#include<bits/stdc++.h>
#define int long long
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define INF (1ll<<60)
typedef pair<int, int> pii;
#define FI first
#define SE second
#define all(s) s.begin(),s.end()
#define RREP(i,n) for(int i=(n)-1;i>=0;--i)

int N1, N2;
int M;
int A[66];
int dp[66][100100];

int solve() {
	cin >> N1 >> N2;
	cin >> M;
	rep(i,M)
	{
		cin >> A[i];
	}
	sort(A, A + M);
	int sum = 0;
	int ans = 0;
	rep(i,M)
	{
		rep(j,N1+1)
		{
			ans = max(ans, dp[i][j]);
			int jj = sum - j;
			if (jj < 0)
				break;
			if (j + A[i] <= N1) {
				dp[i + 1][j + A[i]] = max(dp[i + 1][j + A[i]], dp[i][j] + 1);
			}
			if (jj + A[i] <= N2) {
				dp[i + 1][j] = max(dp[i + 1][j], dp[i][j] + 1);
			}
		}
		sum += A[i];
	}
	rep(i,N1+1)
		ans = max(ans, dp[M][i]);
	return ans;
}

signed main() {
	int d;
	cin >> d;
	rep(i,d)
	{
		cout << solve() << endl;
		memset(A, 0, sizeof(A));
		memset(dp, 0, sizeof(dp));
	}
}