#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define ll long long
const int N = 5e3 + 4;
const int MOD = 1e9 + 7;

using namespace std;

int solve() {
  // Your solution logic here
  int n, k;
  cin >> n >> k;

  // Array of +ve integers (1 based indexing)
  vector<int> a(n + 1);

  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }

  int INF = n + 2;
  vector<vector<int>> dp(
      n + 1, vector<int>(k + 1, INF)); // dp[i][j] = smallest subset with sum =
                                       // j from the first i elements

  dp[0][0] = 0; // Empty subset

  for (int i = 1; i <= n; i++) {
    // starting from k - a[i] as we add a[i] to each subset
    for (int j = 0; j <= k; j++) {
      if (dp[i - 1][j] != INF) {
        dp[i][j] =
            min(dp[i][j],
                dp[i - 1][j]); // skip adding a[i] in existing subset with sum j
        if (j + a[i] <= k) {
          dp[i][j + a[i]] =
              min(dp[i][j + a[i]],
                  dp[i - 1][j] + 1); // try adding a[i] in a subset with sum j
        }
      }
    }
  }

  if (dp[n][k] == INF) {
    cout << "Answer doesn't exist" << endl;
  } else {
    cout << dp[n][k] << endl;
  }

  return 0;
}

int main() {
  int t = 1;
  cin >> t;

  while (t--) {
    solve();
  }

  return 0;
}