#include <iostream>
#include <vector>
#include <algorithm>
#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))
#define repeat_reverse(i,n) for (int i = (n)-1; (i) >= 0; --(i))
#define whole(f,x,...) ([&](decltype((x)) y) { return (f)(begin(y), end(y), ## __VA_ARGS__); })(x)
using namespace std;
int main() {
    int dataset; cin >> dataset;
    while (dataset --) {
        // input
        int n1, n2, m; cin >> n1 >> n2 >> m;
        vector<int> a(m); repeat (i,m) cin >> a[i];
        // roughly estimate
        whole(sort, a);
        int acc = 0;
        int cnt = 0;
        while (cnt < m and acc + a[cnt] <= n1 + n2) {
            acc += a[cnt];
            ++ cnt;
        }
        // check the boundary
        vector<bool> dp(n1+1);
        dp[0] = true;
        repeat (j, cnt) {
            repeat_reverse (i, n1) if (dp[i]) {
                if (i + a[j] < n1+1) {
                    dp[i + a[j]] = true;
                }
            }
        }
        int last = n1;
        while (not dp[last]) -- last;
        bool found = (acc - last <= n2);
        // output
        cout << (cnt - not found) << endl;
    }
    return 0;
}