#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define mem(a) memset(a,0,sizeof(a))
#define pd(a) printf("%.10f\n",a)
#define pb(a) push_back(a)
#define in(a) insert(a)
#define pi M_PI
#define R cin>>
#define F first
#define S second
#define C class
#define ll long long
#define ln cout<<'\n'
template<C T>void pr(T a){cout<<a;ln;}
template<C T,C T2>void pr(T a,T2 b){cout<<a<<' '<<b;ln;}
template<C T,C T2,C T3>void pr(T a,T2 b,T3 c){cout<<a<<' '<<b<<' '<<c;ln;}
template<C T>void PR(T a,int n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
bool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;

int dp[111111];

void Main() {
  int T;
  cin >> T;
  while(T--) {
    int x,y,n;
    cin >> x >> y >> n;
    int a[n],ans=0;
    rep(i,n) cin >> a[i];
    sort(a,a+n);
    int d[n+1];
    d[0]=0;
    rep(i,n) d[i+1]=d[i]+a[i];
    rep(t,2) {
      swap(x,y);
      memset(dp,-1,sizeof(dp));
      dp[0]=0;
      rep(i,n) {
        rrep(j,100001) {
          if(dp[j]==-1) continue;
          if(d[i+1]-j<=y) ans=max(ans,i+1);
          if(j+a[i]<=x) dp[j+a[i]]=max(dp[j+a[i]],dp[j]+1);
        }
      }
    }
    pr(ans);
  }
}

int main() {
  ios::sync_with_stdio(0);cin.tie(0);
  Main();return 0;
}