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

typedef long long ll;
typedef vector< int > vi;
typedef vector< vi > vvi;
typedef vector< ll > vl;
typedef vector< vl > vvl;
typedef pair< int, int > pii;
typedef vector< pii > vp;
typedef vector< double > vd;
typedef vector< vd > vvd;
typedef vector< string > vs;

template< class T1, class T2 >
int upmin( T1 &x, T2 v ){
  if( x > v ){
    x = v;
    return 1;
  }
  return 0;
}

template< class T1, class T2 >
int upmax( T1 &x, T2 v ){
  if( x < v ){
    x = v;
    return 1;
  }
  return 0;
}

const int INF = 0x3f3f3f3f;

int dp[ 60 + 1 ][ 100000 + 1 ];

void init(){
  int T; cin >> T;
  for( int kase = 1; kase <= T; ++kase ){
    int N1, N2; cin >> N1 >> N2;
    if( not ( N1 <= N2 ) )
      swap( N1, N2 );
    int M; cin >> M;
    vi A( M );
    for( int i = 0; i < M; ++i )
      cin >> A[ i ];
    sort( A.begin(), A.end() );
    dp[ 0 ][ 0 ] = kase;
    for( int i = 0; i < M; ++i )
      for( int j = N1; j >= 0; --j )
        if( dp[ i ][ j ] == kase ){
          dp[ i + 1 ][ j ] = kase;
          if( j + A[ i ] <= N1 )
            dp[ i + 1 ][ j + A[ i ] ] = kase;
        }
    int ans = 0;
    for( int i = 1, s = 0; i <= M; ++i ){
      s += A[ i - 1 ];
      int max_taken = 0;
      for( int j = 1; j <= N1; ++j )
        if( dp[ i ][ j ] == kase )
          max_taken = j;
      if( s - max_taken <= N2 )
        ans = i;
    }
    cout << ans << endl;  
  }
}

void preprocess(){

}

void solve(){

}

signed main(){
  ios::sync_with_stdio( 0 );
  init();
  preprocess();
  solve();
  return 0;
}