For this Question: Ved is a salesman. He needs to earn at least W rupees in N days for his livelihood. However, on a given day i(1 &le; i &le; N), he can only earn A<sub>i</sub> rupees by working on that day.
Ved, being a lazy salesman, wants to take as many holidays as possible. It is known that on a holiday, Ved does not work and thus does not earn anything. Help maximize the number of days on which Ved can take a holiday. It is guaranteed that Ved can always earn at least W rupees by working on all days.The first line contains a single integer T - the number of test cases. Then the test cases follow. The first line of each test case contains two integers N and W - the size of the array A and the money Ved has to earn in those N days. The second line of each test case contains N space- separated integers A<sub>1</sub>, A<sub>2</sub>,...., A<sub>N</sub> denoting the money which Ved can earn on each day.

<b>Constraints</b>
1 &le; T &le; 100
1 &le; W &le; 10000
1 &le; N &le; 100
1 &le; A<sub>i</sub> &le; 100
It is guaranteed that Ved can always earn at least W rupees by working on all days.For each test case, output the maximum number of holidays Ved can take.Sample Input :
3
5 10
3 2 6 1 3
4 15
3 2 4 6
6 8
9 12 6 5 2 2
Sample Output :
2
0
5
Explanation
Ved can work on 2-nd, 3-rd and 5-th day earning 2 + 6 + 3 = 11 rupees ≥W rupees. Thus he can take 2 holidays on the 1-st and the 4-th day., I have written this Solution Code: tc = int(input())
for x in range(tc):
    n, w = map(int, input().split())
    a = list(map(int, input().split()))
    a.sort()
    a.reverse()
    sum = 0
    i = 0
    while sum < w:
        sum = sum + a[i]
        i = i+1
    print(n-i), In this Programming Language: Python, Now tell me if this Code is compilable or not?