#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y) {
  long long temp = x;
  long long ans = 1;
  while (y) {
    if (y & 1) ans = (ans * temp) % 998244353;
    temp = (temp * temp) % 998244353;
    y >>= 1;
  }
  return ans;
}
int test = 0;
void solve() {
  long long n, k, ans = 0, mi = 999999;
  cin >> n >> k;
  vector<long long> v(n);
  for (int i = 0; i < n; i++) {
    cin >> v[i];
    mi = min(mi, v[i]);
  }
  int f = 0;
  for (int i = 0; i < n; i++) {
    if (mi == v[i] && f == 0) {
      f = 1;
      continue;
    }
    if (k > v[i]) ans += (k - v[i]) / mi;
  }
  cout << ans << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int q;
  cin >> q;
  while (q--) solve();
  return 0;
}
