#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <fstream>
#include <random>
//#include <time.h>
#include <ctime>
#pragma endregion //#include
/////////
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)
/////////
#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)1e18+20;
const double PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

/*
thx
http://hamayanhamayan.hatenablog.jp/entry/2016/07/13/160541
*/
void solve(){
	int D;
	cin >> D;
while(D--){
	int N1,N2;
	cin >> N1 >> N2;
	int M;
	cin >> M;
	vector<int> A(M);
	vector<int> sum(M,0);
	for(int i=0;i<M;++i){
		cin >> A[i];
	}
	sort(A.begin(), A.end());
	for(int i=0;i<M;++i){
		if( i ) sum[i] += sum[i-1];
		sum[i] += A[i];
	}
	const int MAX = 100000;
	vector< vector<int> > dp(M+1,vector<int>(MAX+1,0));
	dp[0][0] = 1;
	int ans = 1;
	for(int i=0;i<M;++i){
		for(int j=0;j<=MAX;++j){//N1に使っている長さ
			if( dp[i][j] ){
				int Len1 = N1-j;
				int Len2 = N2-(sum[i]-A[i]-j);
				if( A[i] <= Len1 ){
					dp[i+1][j+A[i]] = max(dp[i+1][j+A[i]],dp[i][j]+1);
					ans = max(ans,dp[i+1][j+A[i]]);
				}
				if( A[i] <= Len2 ){
					dp[i+1][j] = max(dp[i+1][j],dp[i][j]+1);
					ans = max(ans,dp[i+1][j]);
				}
			}
		}
	}
	cout << ans-1 << endl;
}
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	

	solve();
}
#pragma endregion //main()