#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

const int MAX = 100001;
int n1, n2, m, dp[61][MAX], A[61];

void solve(){
    MEM(dp, -1);

    sort(A, A + m);

    dp[0][n1] = n2;
    int ans = 0;
    rep(i, m){
        int a = A[i];
        rep(j, n1 + 1)if(dp[i][j] != -1){
            if(j - a >= 0){
                smax(ans, i + 1);
                smax(dp[i + 1][j - a], dp[i][j]);
            }
            if(dp[i][j] - a >= 0){
                smax(ans, i + 1);
                smax(dp[i + 1][j], dp[i][j] - a);
            }
        }
    }
    cout << ans << endl;
}

int main(){
    int d;
    while(cin >> d){
        while(d--){
            cin >> n1 >> n2 >> m;
            rep(i, m)scanf("%d", &A[i]);
            solve();
        }
    }
}