#include <bits/stdc++.h>
using namespace std;
#define int long long   // <-----!!!!!!!!!!!!!!!!!!!

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()

typedef long long ll;
typedef pair<int, int> Pii;
typedef tuple<int, int, int> TUPLE;
typedef vector<int> V;
typedef vector<V> VV;
typedef vector<VV> VVV;
typedef vector<vector<int>> Graph;
const int inf = 1e9;
const int mod = 1e9 + 7;

// int m;
// V a;
// set<Pii> st;
// int dfs(int i, int x, int y) {
//     if (st.count(Pii(i, x))) return i;
//     if (x < 0 || y < 0) return i - 1;
//     st.insert(Pii(i, x));
//     return max(dfs(i + 1, x - a[i], y), dfs(i + 1, x, y - a[i]));
// }

const int MAX_L = 1e5 + 1;
const int MAX_M = 60 + 1;
const int MAX_NUM_STATE = MAX_L * MAX_M;

int m;
V a;
// bool done[MAX_NUM_STATE + 1];
bool done[MAX_M][MAX_L];
int dfs(int i, int x, int y) {
    // if (done[MAX_L * i + x]) return i;
    if (x < 0 || y < 0) return i - 1;
    // cerr << i << " " << x << endl;
    if (done[i][x]) return i;

    // done[MAX_L * i + x] = true;
    done[i][x] = true;
    return max(dfs(i + 1, x - a[i], y), dfs(i + 1, x, y - a[i]));
}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

    int d;
    cin >> d;
    rep(_, d) {
        int n1, n2;
        cin >> n1 >> n2;
        cin >> m;
        a.resize(m);
        rep(i, m) cin >> a[i];
        sort(all(a));
        a.emplace_back(inf);
        m++;
        rep(i, MAX_M) rep(j, MAX_L) done[i][j] = false;
        cout << dfs(0, n1, n2) << endl;
    }

}