N = int(input())
        
for i in range(N):
    n1, n2 = sorted(list(map(int, input().split(' '))))
    m = int(input())
    fragments = sorted(list(map(int, input().split(' '))))

    acc = 0
    count = 0
    while count < m and acc + fragments[count] <= n1 + n2:
        acc = acc + fragments[count]
        count = count + 1

    dp = [False for _ in range(n1+1)]
    dp[0] = True

    for i in range(count):
        for j in reversed(range(n1)):
            if dp[j]:
                if j + fragments[i] < n1+1:
                    dp[j + fragments[i]] = True

    last = n1
    while not dp[last]:
        last = last - 1

    found = (acc - last <= n2)
    print(count - (0 if found else 1))