d = int(input())

for _ in range(d):
    n1, n2 = map(int, input().split())
    m = int(input())
    A = list(map(int, input().split()))
    A.sort()
    dp = [[False]*(n1+1) for _ in range(2)]
    dp[0][0] = True
    acc = 0
    ans = 0
    
    for i in range(m):
        for j in range(n1+1):
            dp[(i+1)&1][j] = False
            
        for j in range(n1+1):
            if j+A[i]<=n1:
                dp[(i+1)&1][j+A[i]] |= dp[i&1][j]
            
            n2_used = acc-j
            
            if n2_used+A[i]<=n2:
                dp[(i+1)&1][j] |= dp[i&1][j]
            
        if True in dp[(i+1)&1]:
            ans = i+1
        else:
            break
            
        acc += A[i]
    
    print(ans)