#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[2][61][100005];

int f(int a, int b, vector<int> &v) {
  int old = 0;
  int now = 1;
  rep(i, 0, 2)rep(j, 0, 61)rep(k, 0, 100005)dp[i][j][k] = 1000000000;
  dp[old][0][0] = 0;
  dp[old][1][v[0]] = 0;
  dp[old][1][0] = v[0];
  rep(i, 1, v.sz) {
    rep(j, 0, v.sz + 1) {
      rep(k, 0, 100001) {
        dp[now][j][k] = min(dp[now][j][k], dp[old][j][k]);
        if (k + v[i] <= 100003) {
          dp[now][j + 1][k + v[i]] = min(dp[now][j + 1][k + v[i]], dp[old][j][k]);
        }
        dp[now][j + 1][k] = min(dp[now][j + 1][k], dp[old][j][k] + v[i]);
      }
    }
    rep(i,0,61)rep(j,0,100005)dp[old][i][j] = 1000000000;
    old = 1-old;
    now = 1-now;
  }
  int mx = 0;
  rep(i,0,61){
    rep(j,0,100003){
      if(j<=a&&dp[old][i][j]<=b){
        mx = max(mx,i);
      }
    }
  }
  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;
}