#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <vector>

using namespace std;
typedef long long ll;

int main() {
  int d;
  cin >> d;

  for (int t = 0; t < d; ++t) {
    int n1, n2;
    cin >> n1 >> n2;
    int m;
    cin >> m;
    vector<int> A(m);

    for (int i = 0; i < m; ++i) {
      cin >> A[i];
    }

    sort(A.begin(), A.end());
    int dp[n1 + 1][2];
    memset(dp, -1, sizeof(dp));
    dp[0][0] = 0;
    dp[0][1] = n2;
    int ans = 0;

    for (int i = 0; i < m; ++i) {
      int a = A[i];

      for (int x = n1; x >= 0; --x) {
        if (dp[x][0] == -1) continue;

        if (x + a <= n1 && dp[x + a][0] < dp[x][0] + 1) {
          dp[x + a][0] = dp[x][0] + 1;
          dp[x + a][1] = dp[x][1];
          ans = max(ans, dp[x + a][0]);
        }

        if (dp[x][1] >= a) {
          dp[x][0] += 1;
          dp[x][1] -= a;
          ans = max(ans, dp[x][0]);
        }
      }
    }

    cout << ans << endl;
  }

  return 0;
}