C :: Pockets

Time Limit: 2 Seconds    Memory Limit: 32768 KB

Mr. Mohandes has n pockets in his blue jeans. He has c_i Oshloghs in his ith pocket. He plans to buy a tablet with the price of  w Oshloghs. Mr. Mohandes asks you to find the minimum number of pockets whose total money is at least w Oshloghs.

Input

The first line of the input includes the number of test cases, 1≤t≤100. Each test case contains two lines. The first line contains two integers, 1≤n≤1000 and 1≤w≤10⁹. The following line contains n integers, 1≤a₁,a₂,…,a_n≤1000, separated by a single space.

Output

For each test case, print one line containing the minimum number of pocket whose total money is at least w Oshloghs.   In the case of impossibility, print “No solution!” instead. 

Sample Input

3
2 10
1 9  
3 20
4 5 6
4 7 
2 3 1 4

Sample Output

2
No solution!
2

Submit

Source: 12th Iran Nationwide Internet Contest I