#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n, k;
  cin >> n >> k;
  vector<long long> a(n);
  for (long long i = 0; i < n; i++) cin >> a[i];
  long long x = min_element(a.begin(), a.end()) - a.begin();
  long long ans = 0;
  for (long long i = 0; i < n; i++) {
    long long u = a[i];
    if (u < k && a[x] < k && i != x) ans += (k - u) / a[x];
  }
  cout << ans << endl;
}
int32_t main() {
  long long t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
