def solve():
    N,M=map(int,input().split())
    K=int(input())
    A=list(map(int,input().split()))
    list.sort(A)
    maxN=100010
    dp=[0]*maxN
    dp[0]=1
    ans=0
    cum=0
    for i in range(K):
        cum+=A[i]
        ndp=dp[:]
        for j in range(maxN):
            if dp[j] and j+A[i]<maxN:
                ndp[j+A[i]]=1
        dp=ndp[:]
        for j in range(maxN):
            if dp[j] and j<=N and cum-j<=M:
                ans=max(ans,i+1)
    print(ans)

d=int(input())
while d:
    solve()
    d-=1