#include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
void solve() {
  long long int n, k;
  cin >> n >> k;
  vector<long long int> v(n);
  long long int mine = LLONG_MAX;
  long long int idx = -1;
  for (int i = 0; i < n; i++) {
    cin >> v[i];
    mine = min(mine, v[i]);
    if (v[i] == mine) {
      idx = i;
    }
  }
  long long int res = 0;
  for (int i = 0; i < n; i++) {
    if (i != idx) {
      res += (max((long long int)0, (k - v[i]) / mine));
    }
  }
  cout << res << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}
