fork(1) download
  1. def solve():
  2. N,B=map(int,input().split())
  3. A=list(map(int,input().split()))
  4. c=0
  5. for i in range(len(A)):
  6. if(B>=A[i]):
  7. B-=A[i]
  8. c+=1
  9. return c
  10. T=int(input())
  11. for j in range(1,T+1):
  12. print("Case #{}: {}".format(j,solve()))
Success #stdin #stdout 0.02s 9308KB
stdin
3
4 100
20 90 40 90
4 50
30 30 10 10
3 300
999 999 999
stdout
Case #1: 2
Case #2: 3
Case #3: 0