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

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define UB upper_bound
#define LB lower_bound
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

const int W = 100001;

int main() {
	int d;
	cin >> d;
	inc(q, d) {
		int l[2], m, a[60];
		cin >> l[0] >> l[1] >> m;
		inc(i, m) { cin >> a[i]; }
		
		sort(l, l + 2);
		sort(a, a + m);
		int ans = 0, sum = 0;
		inc(i, m) {
			sum += a[i];
			if(sum > l[0] + l[1]) { break; }
			
			bool dp[W];
			inc(j, W) { dp[j] = false; }
			dp[0] = 1;
			
			bool flag = false;
			incII(j, 0, i) {
				decII(k, 0, l[0]) {
					int nw =  k + a[j];
					if(dp[k] && nw <= l[0]) {
						dp[nw] = true;
						if(sum - nw <= l[1]) { flag = true; break; }
					}
				}
				if(flag) { break; }
			}
			if(flag) { ans = i + 1; } else { break; }
		}
		
		cout << ans << "\n";
	}
	
	return 0;
}