#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;

// tourist set
template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << '\n'; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// tourist set end

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

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<'\n'
#define p2(s, t) cout << (s) << " " << (t) << '\n'
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << '\n'
#define p_yes() p("YES")
#define p_no() p("NO")
#define SZ(x) ((int)(x).size())
#define SORT(A) sort(ALL(A))
#define RSORT(A) sort(ALL(A), greater<ll>())

void no(){p_no(); exit(0);}
void yes(){p_yes(); exit(0);}

const ll mod = 1e9 + 7;
const ll inf = 1e18;
const double PI = acos(-1);

ll dp[61][100010];

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll T;
    cin >> T;

    while(T--){
      ll n1, n2;
      cin >> n1 >> n2;
      if(n1>n2) swap(n1, n2);
      ll all = n1+n2;
      ll N; cin >> N;
      VI A(N);
      rep(i, N){
        cin >> A[i];
      }
      SORT(A);
      debug(A);
      debug(n1, n2);

      rep(i, 60){
        rep(j, 100010){
          dp[i][j] = -1;
        }
      }
      dp[0][n1] = 0;

      ll sum = 0; // 今までに切り出した長さ
      rep(i, N){
        ll a = A[i]; // 今回切ってほしい長さ
        rep(l, 100001){ // n1側の長さがl
          dp[i+1][l] = dp[i][l]; // copy 同じ本数は絶対に可能
        }

        rep(l, 100001){ // n1側の長さがl
        
          if(dp[i][l]==-1) continue;

          ll b_len = all - sum - l;
          if(b_len<0) continue;

          if(a<=l){
            // Aから切り出す
            chmax(dp[i+1][l-a], dp[i][l] + 1);
            debug(i, l, dp[i+1][l-a]);
          }
          if(a<=b_len){
            // Bから切り出す
            debug(i, l, dp[i+1][l]);
            chmax(dp[i+1][l], dp[i][l] + 1);
          }
        }
        sum += a;
      }

      debug(dp[1][8]);
      debug(dp[1][9]);
      debug(dp[1][10]);

      ll ma = 0;
      rep(i, 100001){
        chmax(ma, dp[N][i]);
      }
      p(ma);
    }
    
    return 0;
}