시간 제한메모리 제한제출정답맞힌 사람정답 비율
2 초 256 MB545436.364%

## 문제

Some mad chemistry dude has made a new atomic virus bomb that will kill everybody. It works like this:

The virus has N different forms. Every second, a virus in one form will transform into one or more viruses of the same or different forms. Furthermore, each form will produce a certain number of tritium atoms during the second it takes to transform. When the total number of such atoms reaches the critical limit L, they explode as a hydrogen bomb.

We want to know how long time it takes from a poor guy gets infected until he blows up.

A simple example would be a virus with only one form, which will transform into two viruses of the same form every second, and will produce one tritium atom in one second. Let’s say that L = 15. After one second there are two viruses and one atom. After two seconds there are four viruses and three atoms. After three seconds there are eight viruses and seven atoms. After four seconds the bomb goes off.

Let’s look at a little more complex example with a virus with two forms A and B, and L = 500. Every second a virus of form A will transform into three viruses of form A and one virus of form B, and produce one tritium atom. A virus of form B will transform into two viruses of form B, and produce one hundred tritium atoms. If we start with one virus of form A, then after one second we have 3 A, 1 B, and 1 atom. After two seconds we have 9 A, 5 B, and 104 atoms. After three seconds we have 27 A, 19 B, and 613 atoms. So the answer is three seconds.

## 입력

The first line of the input gives the number of test cases T ≤ 100. The first line of each test case contains 1 ≤ N ≤ 20 and 1 ≤ L ≤ 1000000000. Then follow N lines, one for each form. The description of a form contains N + 1 non-negative integers less than 1000. The first N describe how many viruses of the different forms it transforms into. The last describes how many tritium atoms it produces in the process.

## 출력

Output one line for each test case. We assume that the patient is infected with one virus of the first form. If the virus bomb will never go off, print “lucky”. Otherwise, print the number of seconds it takes before the patient blows up.

## 예제 입력 1

3
1 15
2 1
2 500
3 1 1
0 2 100
1 15
2 0


## 예제 출력 1

4
3
lucky