#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#include <random>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };
typedef vector<vector<bool> > grid;

int INF = INT_MAX / 2;
ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

int main() {
	int T; cin >> T;
	while (T--) {
		int x, y; cin >> x >> y;
		int N; cin >> N;
		vector<int> a(N);
		for (int& z: a) cin >> z;
		sort(a.begin(), a.end());
		vector<int> dp(x + 1, INF);
		dp[0] = 0;
		int ans = 0;
		for (int i = 0; i < N; i++) {
			int dz = a[i];
			vector<int> _dp(x + 1, INF);
			for (int z = 0; z + dz <= x; z++)
				_dp[z + dz] = min(_dp[z + dz], dp[z]);
			for (int z = 0; z <= x; z++)
				_dp[z] = min(_dp[z], dp[z] + dz);
			dp = _dp;
			for (int z = 0; z <= x; z++)
				if (dp[z] <= y)
					ans = i + 1;
		}
		cout << ans << endl;
	}
}