def read_data():
    n1, n2 = map(int, input().split())
    m = int(input())
    As = list(map(int, input().split()))
    return n1, n2, m, As

def solve(n1, n2, m, As):
    As.sort()
    cum = 0
    n12 = n1 + n2
    ans = 0
    dp = [0] * (n1 + 1)
    dp[0] = 1
    for a in As:
        cum += a
        if cum > n12:
            return ans
        for pos in range(n1, a - 1, -1):
            if dp[pos - a]:
                dp[pos] = 1
        for pos in range(n1, -1, -1):
            if dp[pos]:
                if pos + n2 < cum:
                    return ans
                else:
                    break
        ans += 1
    return ans

if __name__ == '__main__':
    d = int(input())
    for i in range(d):
        n1, n2, m, As = read_data()
        print(solve(n1, n2, m, As))