#!/usr/bin/env python3
# after reading the editorials

import array


UNDEF = -1


def solve(n1, n2, m, xs0):
    xs = sorted(xs0)
    dp = [array.array("i", (UNDEF for _ in range(n1 + 1)))
          for _ in range(m + 1)]
    dp[0][0] = 0
    s = 0
    for i in range(m):
        for j in range(n1 + 1):
            if dp[i][j] >= 0:
                c1 = j + xs[i]
                c2 = s - j + xs[i]
                if c1 <= n1:
                    dp[i + 1][c1] = dp[i][j] + 1
                if c2 <= n2:
                    dp[i + 1][j] = dp[i][j] + 1
        s += xs[i]
    return max(max(dpr) for dpr in dp)


def main():
    d = int(input())
    for _ in range(d):
        n1, n2 = map(int, input().split())
        m = int(input())
        xs = map(int, input().split())
        print(solve(n1, n2, m, xs))


if __name__ == '__main__':
    main()