#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE1 10
#define SIZE2 20
#else
#define SIZE1 100
#define SIZE2 123450
#endif

int D,M;
int N[2];
int A[SIZE1];
// i本目を切り出した時,1本目の残り長さ→2本目の残り長さの最大
int DP[SIZE1][SIZE2];

void solve() {
    cin>>D;
    while(D--) {
        cin>>N[0]>>N[1]>>M;
        REP(i,M)cin>>A[i];
        sort(A,A+M);
        REP(i,M)REP(j,SIZE2)DP[i][j]=-1;
        int ans = 0;
        int a = A[0];
        if (N[0]>=a)DP[0][N[0]-a] = N[1];
        if (N[1]>=a)DP[0][N[0]] = N[1]-a;
        if (N[0]>=a || N[1]>=a) ans++;
        REP(i,M-1)REP(j,SIZE2) {
            if (DP[i][j]<0)continue;
            int a = A[i+1];
            if (DP[i][j]>=a) DP[i+1][j] = max(DP[i+1][j], DP[i][j]-a);
            if (j>=a) DP[i+1][j-a] = max(DP[i+1][j-a], DP[i][j]);
            if (DP[i][j]>=a || j>=a) ans = i+2;
        }
        cout << ans << endl;
    }
}