#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
const long long int INF = 1e9 + 7;
long long int pow(long long int x, long long int y) {
  long long int res = 1;
  while (y > (long long int)0) {
    if (y & (long long int)1) res = ((res) * (x));
    y = y >> (long long int)1;
    x = ((x) * (x));
  }
  return res;
}
long long int powm(long long int x, long long int y, long long int p) {
  long long int res = 1;
  x = x % p;
  while (y > (long long int)0) {
    if (y & (long long int)1) res = (res * x) % p;
    y >>= (long long int)1;
    x = (x * x) % p;
  }
  return res;
}
void solve() {
  long long int n, k;
  cin >> n >> k;
  vector<long long int> v(n);
  for (long long int i = 0; i < n; i++) cin >> v[i];
  sort(v.begin(), v.end());
  long long int ans = 0;
  for (long long int i = 1; i < n; i++) ans += (k - v[i]) / v[0];
  cout << ans << endl;
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int t;
  cin >> t;
  while (t--) {
    solve();
  }
}
