There are N houses for sale. The i-th house costs A_i dollars to buy. You have a budget of B dollars to spend.

What is the maximum number of houses you can buy?

Input

The first line of the input gives the number of test cases, T. T test cases follow. Each test case begins with a single line containing the two integers N and B. The second line contains N integers. The i-th integer is A_i, the cost of the i-th house.

Output

For each test case, output one line containing Case #x: y, where x is the test case number (starting from 1) and y is the maximum number of houses you can buy.

Limits

Time limit: 1 second.
Memory limit: 512 MB.
1 ≤ T ≤ 100.
1 ≤ B ≤ 10⁵.
1 ≤ A_i ≤ 1000, for all i.

Sample testcases (0pts)

Sample Testcases

Test Set 1 (49pts)

1 ≤ N ≤ 100.

Test Set 2 (51pts)

1 ≤ N ≤ 10⁵.

Sample

3
4 100
20 90 40 90
4 50
30 30 10 10
3 300
999 999 999

Case #1: 2
Case #2: 3
Case #3: 0

Note: Unlike previous editions, in Kick Start 2020, all test sets are visible verdict test sets, meaning you receive instant feedback upon submission.