#include <bits/stdc++.h>
using namespace std;

template<class T1, class T2> bool chmin(T1 &a, T2 b) { if (b < a) { a = b; return true; } return false; }
template<class T1, class T2> bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return true; } return false; }

void solve() {
	int n1, n2;
	cin >> n1 >> n2;

	int m;
	cin >> m;

	vector<int> a(m);
	for (int i = 0; i < m; i++) cin >> a[i];
	sort(a.begin(), a.end());

	int ans = 0;
	for (int i = 0; i <= m; i++) {
		bitset<100100> dp;
		dp[0] = 1;
		int sum = 0;
		for (int j = 0; j < i; j++) {
			sum += a[j];
			dp |= dp << a[j];
		}
		for (int j = 0; j <= min(100000, sum); j++) {
			int k = sum - j;
			if (dp[j] && j <= n1 && k <= n2) {
				ans = i;
			}
		}
	}
	cout << ans << endl;
}

int main() {
	int d;
	cin >> d;
	while (d--) solve();
}