#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>

using namespace std;

const int N_MAX = 100000;

int solve() {
	int n1, n2, m;
	cin >> n1 >> n2 >> m;
	if (n1 > n2) {
		swap(n1, n2);
	}
	vector<int> a(m);
	for (int i = 0; i < m; i++) {
		cin >> a[i];
	}
	sort(a.begin(), a.end());
	vector<int> sum(m+1, 0);
	for (int i = 0; i < m; i++) {
		sum[i+1] = sum[i] + a[i];
	}

	vector<vector<bool>> dp(m+1, vector<bool>(2*N_MAX + 1, false));
	dp[0][0] = true;
	for (int i = 0; i < m; i++) {
		for (int j = 0; j <= n1; j++) {
			if (!dp[i][j]) {
				continue;
			}
			dp[i+1][j] = true;
			dp[i+1][j + a[i]] = true;
		}
	}

/*
	printf("idx");
	for (int j = 0; j <= n1; j++) {
		printf("%3d", j);
	}
	printf("\n");
	for (int i = 0; i <= m; i++) {
		printf("%2d:", i);
		for (int j = 0; j <= n1; j++) {
			cout << "  " << 1 * dp[i][j];
		}
		printf(": sum %2d\n", sum[i]);
	}
*/

	for (int i = m; i >= 0; i--) {
		for (int j = n1; j >= 0; j--) {
			if (dp[i][j] && sum[i] - j <= n2) {
				return i;
			}
		}
	}

	return 0;
}

int main() {
	int d;

	cin >> d;
	for (int i = 0; i < d; i++) {
		int ans = solve();
		cout << ans << endl;
	}
	return 0;
}