#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
#define ITR(i,c) for(auto i=begin(c);i!=end(c);i++)
#define FOR(i,a,n) for(int i=a;i<(int)(n);i++)
#define FORR(x,arr) for(auto &x:arr)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) begin(c),end(c)
#define GET_MAX(c) (*std::max_element(ALL(c)))
#define GET_MIN(c) (*std::min_element(ALL(c)))
#define PB push_back
#define MP make_pair
const int DX[4]={0,1,0,-1}, DY[4]={-1,0,1,0};
const int INF = 1e9;

vector<int> a;
vector<int> sum;
int n1,n2,m;
int dp[61][100001];

int func(int i, int l1) {
    if(dp[i][l1]!=INF) return dp[i][l1];

    int l2=n1+n2-sum[i-1]-l1;
    if(l1<=0 && l2<=0) {
        return dp[i][l1]=0;
    }
    if(i==m) {
        if(l1-a[i]>=0 || l2-a[i]>=0) {
            return dp[i][l1]=1;
        }
    }

    int M=0;
    if(l1-a[i]>=0) {
        M = 1 + func(i+1, l1-a[i]);
    }
    if(l2-a[i]>=0) {
        M = max(M, 1 + func(i+1, l1));
    }
    return dp[i][l1]=M;
}

int main(int argc, char const *argv[]) {
    int d;
    cin >> d;
    REP(loop,d) {
        cin >> n1 >> n2 >> m;
        a.clear();
        a.resize(m+1);
        a[0]=0;
        FOR(i,1,m+1) cin >> a[i];
        sort(ALL(a));

        sum.clear();
        sum=a;
        FOR(i,1,m+1) sum[i]+=sum[i-1];

        REP(i,61) REP(j,100001) dp[i][j]=INF;

        cout << func(1,n1) << endl;
    }
    return 0;
}