#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
#define REP(i,n) for(ll i = 0; i < (n); ++i)
#define FOR(i,s,e) for (ll i = s; i < (ll)e; i++)
#define TEN(x) ((ll)1e##x)

int main() {
	cin.tie(0); // cinとcoutの連携を切る
	ios_base::sync_with_stdio(false);
	cout << fixed << setprecision(50);
	ll d; cin >> d;
	REP(_, d) {
		ll n1, n2, m; cin >> n1 >> n2 >> m;
		vl a(m); REP(i, m) cin >> a[i];
		vector<vvl> dp(m + 1, vvl(m + 1, vl(n1 + 1, TEN(9))));
		dp[0][0][0] = 0; // dp[i人までで][j人が満足し][n1のうちk利用するときの] = n2の利用した最小の長さ
		FOR(i, 1, m + 1) REP(j, m + 1) REP(k, n1 + 1) {
			if(j > 0) dp[i][j][k] = min(dp[i][j][k], dp[i - 1][j - 1][k] + a[i - 1]);
			if(j > 0 && k - a[i - 1] >= 0) dp[i][j][k] = min(dp[i][j][k], dp[i - 1][j - 1][k - a[i - 1]]);
			dp[i][j][k] = min(dp[i][j][k], dp[i - 1][j][k]);
		}

		ll ans = 0;
		REP(i, m + 1) REP(j, n1 + 1) if (dp[m][i][j] <= n2) ans = max(ans, i);
		cout << ans << endl;
	}
	return 0;
}