#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; }

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

  vvi dp(M+1, vi(N1+1, -1));
  dp[0][0] = 0;
  rep(i, M) rep(j, N1+1) if (dp[i][j] >= 0) {
    dp[i+1][j] = dp[i][j];
    if (j + A[i] <= N1) amax(dp[i+1][j + A[i]], dp[i][j] + 1);
  }

  /*
  rep(i,M+1) {
    _p("dp[%d]:", i);
    rep(j,SZ(dp[i])) _p(" %d", dp[i][j]);
    _p("\n");
  }
  */

  int ans = 0;
  vi dp2(N2+1, -1);
  vector<bool> done(M+1);
  rrep(i, N1+1) {
    if (dp[M][i] == -1) continue;
    if (done[dp[M][i]]) continue;

    done[dp[M][i]] = 1;
    int x = i;
    //_p("x: %d\n", x);
    vector<bool> used(M);
    rrep(i, 1, M+1) {
      if (dp[i][x] == 0) break;
      if (x - A[i-1] >= 0 && dp[i][x] == dp[i-1][x - A[i-1]] + 1) {
        used[i-1] = 1;
        x -= A[i-1];
      }
    }
    //forr(u, used) _p("u: %d\n", u);
    fill(ALL(dp2), -1);
    dp2[0] = 0;
    int ma = 0;
    rep(i, M) if (!used[i]) rrep(j, ma+1) if (dp2[j] >= 0) {
      if (j + A[i] <= N2) {
        amax(dp2[j + A[i]], dp2[j] + 1);
        ma = max(ma, j + A[i]);
      }
    }
    //_p("dp2:"); rep(j,SZ(dp2)) _p(" %d", dp2[j]);_p("\n");
    //_p("dp2_max: %d\n", *max_element(ALL(dp2)));
    int cand = *max_element(ALL(dp2)) + dp[M][i];
    amax(ans, cand);
  }

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