#ifdef LOCAL111
#else
	#define NDEBUG
#endif
#include <bits/stdc++.h>
const int INF = 1e8;
using namespace std;

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#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(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define RBP(i,a) for(auto& i : a)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
#else
	#define DEBUG(x) true
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
#define rangej(a,b,c) ((a) <= (c) and (c) < (b))
#define rrangej(b,c) rangej(0,b,c)
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}

typedef pair<int,int> P;
typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<LL,LL> LP;

void ios_init(){
	//cout.setf(ios::fixed);
	//cout.precision(12);
#ifdef LOCAL111
	return;
#endif
	ios::sync_with_stdio(false); cin.tie(0);	
}

int main()
{
	ios_init();
	int d;
	cin >> d;
	REP(hoge,d){
		int n1, n2;
		cin >> n1 >> n2;
		int m;
		cin >> m;
		vector<int> a(m);
		REP(i,m) cin >> a[i];
		sort(ALL(a));
		//vector<vector<int>> dp(m,vector<int>(max(n1, n2), 0));
		vector<vector<bool>> dp1(m+1,vector<bool>(n1+1,false));
		vector<vector<bool>> dp2(m+1,vector<bool>(n2+1,false));
		dp1[0][0] = dp2[0][0] = true;
		REP(i,m){
			REP(j,n1+1) dp1[i+1][j] = dp1[i][j];
			REP(j,n1+1-a[i]){
				dp1[i+1][j+a[i]] = dp1[i+1][j+a[i]]|dp1[i][j];
			}
		}
		REP(i,m){
			REP(j,n2+1) dp2[i+1][j] = dp2[i][j];
			REP(j,n2+1-a[i]){
				dp2[i+1][j+a[i]] = dp2[i+1][j+a[i]]|dp2[i][j];
			}
		}
		int ans = 0;
		int sum = 0;
		// cout << endl;
		// REP(i,m+1) pite(ALL(dp1[i]));
		// cout << endl;
		// REP(i,m+1) pite(ALL(dp2[i]));
		// cout << endl;
		REP(i,m){
			DEBUG(i);
			int ma = 0;
			sum += a[i];
			DEBUG(sum);
			RREP(j,n1+1){
				if(dp1[i+1][j]){
					ma = j;
					break;
				}
			}
			DEBUG(ma);
			if(n2 >= sum-ma){
				ans = i+1;
			}
			ma = 0;
			RREP(j,n2+1){
				if(dp2[i+1][j]){
					ma = j;
					break;
				}
			}
			DEBUG(ma);
			if(n1 >= sum-ma){
				ans = i+1;
			}
		}
		cout << ans << endl;
	}
	return 0;
}