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

#define _p(...) (void)printf(__VA_ARGS__)
#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define ALL(x) (x).begin(), (x).end()
#define BIT(n) (1LL<<(n))
#define SZ(x) ((int)(x).size())
#define fst first
#define snd second
typedef vector<int> vi;typedef vector<vi> vvi;typedef pair<int,int> pii;typedef vector<pii> vpii;
typedef long long ll;

template<class T> inline bool amax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }

int dp[61][100001];
bool used[61];

void Main() {
  int N1, N2, M;
  scanf("%d%d%d", &N1, &N2, &M);
  vi A(M);
  rep(i, M) scanf("%d", &A[i]);

  sort(ALL(A));

  auto check = [&](int x) -> bool {
    // x 本
    memset(dp, 0xff, sizeof(dp));
    memset(used, 0, sizeof(used));

    dp[0][0] = 0;
    int ma1 = 0;
    rep(i, x) rep(j, N1+1) if (dp[i][j] >= 0) {
      dp[i+1][j] = dp[i][j];
      if (j + A[i] <= N1) {
        dp[i+1][j + A[i]] = dp[i][j] + 1;
        amax(ma1, j + A[i]);
      }
    }

    int y = ma1;
    rrep(i, 1, x+1) {
      if (dp[i][y] == 0) break;
      if (y - A[i-1] >= 0 && dp[i][y] == dp[i-1][y - A[i-1]] + 1) {
        used[i-1] = 1;
        y -= A[i-1];
      }
    }

    int s2 = 0;
    rep(i, x) if (!used[i]) {
      s2 += A[i];
    }
    return s2 <= N2;
  };

  int ok = 0;
  int ng = M+1;

  while (abs(ok - ng) > 1) {
    int mid = (ok + ng) / 2;
    bool c = check(mid);
    //_P("%d, %d, %d -> %d\n", ok, ng, mid, c);
    if (c) ok = mid;
    else ng = mid;
  }

  _p("%d\n", ok);
}
int main() {
  int T;
  scanf("%d", &T);
  while (T--) Main();
  return 0;
}