#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>

#define REP(i,n) for(int (i)=0;(i)<(n);(i)++)
#define FOR(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define RREP(i,a) for(int (i)=(a)-1;(i)>=0;(i)--)
#define FORR(i,a,b) for(int (i)=(a)-1;(i)>=(b);(i)--)
#define PI acos(-1.0)
#define DEBUG(C) cout<<C<<endl;
#define VI vector<int>
#define VII vector<VI>
#define VL vector<LL>
#define VLL vector<VL>
#define VD vector<double>
#define VDD vector<VD>
#define PII pair<int,int>
#define PDD pair<double,double>
#define PLL pair<LL,LL>
#define VPII vector<PII>
#define ALL(a) (a).begin(),(a).end()
#define SORT(a) sort(ALL(a))
#define REVERSE(a) reverse(ALL(a))
#define MP make_pair
#define FORE(a,b) for(auto &&a:b)

using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const int INF=1e9;
const int MOD=INF+7;

int solve(){
    int n[2]; REP(i,2) cin >> n[i];
    int nsum=n[0]+n[1];
    int m; cin >> m;
    VI a(m),asum(m);
    REP(i,m){
        cin >> a[i];
    }
    SORT(a);
    asum[0]=a[0];
    FOR(i,1,m) asum[i]=asum[i-1]+a[i];
    VII dp(m+1,VI(n[0]+1,-1));
    //dp[i][j] i人目，n1の残り長さj
    dp[0][n[0]]=n[1];
    REP(i,m){
        bool f=false;
        RREP(j,n[0]+1){
            if(dp[i][j]==-1) continue;
            if(j>=a[i]){
                dp[i+1][j-a[i]]=dp[i][j];
                f=true;
            }
            if(dp[i][j]>=a[i]){
                dp[i+1][j]=dp[i][j]-a[i];
                f=true;
            }
        }
        if(!f) return i;
    }
    return m;
}

int main(void){
    int d; cin >> d;
    REP(i,d){
        cout << solve() << endl;
    }
}