#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <list>

using namespace std;

typedef long long ll;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(d) string(1,d)
#define print(x) cout<<#x<<" = "<<x<<endl;

#define MOD 1000000007

int dp[61][100005];

int f(int a, int b, vector<int> &v) {
  sort(all(v));
  rep(i,0,61)rep(j,0,100005)dp[i][j]=1000000000;
  if(v[0]<=a){
    dp[0][v[0]]=0;
  }
  if(v[0]<=b){
    dp[0][0]=v[0];
  }
  rep(i,1,v.sz){
    rep(j,0,a+1){
      if(j+v[i]<=a){
        dp[i][j+v[i]]=min(dp[i][j+v[i]],dp[i-1][j]);
      }
      if(dp[i-1][j]+v[i]<=b){
        dp[i][j] = min(dp[i][j],dp[i-1][j]+v[i]);
      }
    }
  }
  int mx = 0;
  rep(i,0,v.sz){
    rep(j,0,a+1){
      if(dp[i][j]<=b){
        mx = max(mx,i+1);
      }
    }
  }
  return mx;
}

int main() {
  int n;
  cin>>n;
  rep(i,0,n){
    int a,b;
    cin>>a>>b;
    int m;
    cin>>m;
    vector<int> v;
    rep(i,0,m){
      int c;
      cin>>c;
      v.pb(c);
    }
    cout << f(a,b,v) << endl;
  }
  return 0;
}