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

using namespace std;

typedef pair<int, int> PII;

vector<vector<list<PII>>> dp;

void insert(int i, int j, PII p) {
	if (p.first < p.second) {
		swap(p.first, p.second);
	}
	if (p.second < 0) {
		return;
	}

	list<PII>& lst = dp[i][j];

	bool pushable = true;
	for (auto it = lst.begin(); it != lst.end();) {
		if (it->first >= p.first && it->second >= p.second) {
			pushable = false;
			break;
		}

		if (it->first <= p.first && it->second <= p.second) {
			it = lst.erase(it);
		} else {
			it++;
		}
	}

	if (pushable) {
		lst.push_back(p);
	}
}

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

	if (n1 < n2) {
		swap(n1, n2);
	}

	dp.assign(m+1, vector<list<PII>>(m+1));
	dp[0][0].push_back(make_pair(n1, n2));
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < m; j++) {
			dp[i+1][j] = dp[i][j];
		}
		for (int j = 0; j < m; j++) {
			for (auto p : dp[i][j]) {
				insert(i+1, j+1, make_pair(p.first - a[i], p.second));
				insert(i+1, j+1, make_pair(p.first, p.second - a[i]));
			}
		}
	}

	for (int i = m; i >= 0; i--) {
		if (dp[m][i].size() > 0) {
			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;
}