#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

int x,y;
int n;
int a[83];
bool dp[83][252521];
void solve(){
  scanf("%d%d%d",&x,&y,&n);
  REP(i,n)scanf("%d",a+i);
  sort(a,a+n);
  int sum = x+y;
  REP(i,n+1)REP(j,sum+1)dp[i][j]=false;
  dp[0][x] = true;
  REP(i,n){
    bool f = false;
    REP(j,x+y+1){
      if(!dp[i][j])continue;
      int s = j;
      int t = sum-j;
      if(s-a[i]>=0){
        dp[i+1][s-a[i]] = true;
        f = true;
      }
      if(t-a[i]>=0){
        dp[i+1][s] = true;
        f = true;
      }
    }
    if(!f){
      printf("%d\n",i);
      return;
    }
    sum -= a[i];
  }
  printf("%d\n",n);
  return;
}

int main(){
  int d;
  scanf("%d",&d);
  while(d--)solve();
  return 0;
}