#!/usr/bin/env python3
# %%
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


# %%
D = int(readline())


# %%
def solve():
    N1, N2 = map(int, readline().split())
    M = int(readline())
    A = sorted(map(int, readline().split()))
    dp = 1
    S = 0
    for n, x in enumerate(A):
        dp |= dp << x
        S += x
        if S <= N1 or S <= N2:
            continue
        if S > N1 + N2:
            return n
        L = S - N2
        R = N1
        if (dp & (1 << (R + 1)) - 1) >> L:
            continue
        return n
    return M


for _ in range(D):
    print(solve())