#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;

bool dp1[100010];
bool dp2[100010];

int solve(vector<int> &a, vector<pair<int, int> > bb, int cnt);

int main()
{
	int d,bb1,bb2,m;


	cin >> d;
	for (int i = 0; i < d; i++) {
		int cnt=0;
		cin >> bb1 >> bb2 >> m;
		vector<pair<int, int> > bamboo;
		bamboo.push_back(make_pair(bb1, bb2));
		vector<int> a;
		a.resize(m);
		for (int j = 0; j < m; j++) {
			cin >> a[j];
		}
		sort(a.begin(), a.end());

		cnt = solve(a, bamboo, cnt);
		cout << cnt-1 << endl;
	}

    return 0;
}

int solve(vector<int> &a,vector<pair<int,int> > bb, int cnt) {
	vector<pair<int,int> > bbtmp;
	for (int i = 0; i < bb.size(); i++) {
		if (bb[i].first >= a.front()) {
			bbtmp.push_back(make_pair(bb[i].first - a.front(), bb[i].second));
		}
		if (bb[i].second >= a.front()) {
			bbtmp.push_back(make_pair(bb[i].first, bb[i].second - a.front()));
		}
	}
	a.erase(a.begin());

	cnt++;
	if (bbtmp.size()) {
		if (a.size()) {
			cnt = solve(a, bbtmp, cnt);
		}
		else {
			return ++cnt;
		}
	}

	return cnt;
}