#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const long long INFLL = 2e18;
const int MOD = 1e8 + 7;
const int N = 2e5 + 10;
int fx[8] = {+0, +0, +1, -1, +1, +1, -1, -1};
int fy[8] = {+1, -1, +0, +0, +1, -1, +1, -1};
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, k;
    cin >> n >> k;
    int a[n];
    for (int i = 0; i < n; ++i) cin >> a[i];
    sort(a, a + n);
    int ans = 0;
    for (int i = n - 1; i >= 0; --i)
      for (int j = 0; j < n && a[j] + a[i] <= k; ++j)
        while (i != j && a[j] + a[i] <= k) a[i] += a[j], ++ans;
    cout << ans << endl;
  }
}
