#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  sort(a.begin(), a.end());
  int count = 0;
  for (int i = a.size() - 1; i > 0; i--) {
    if (a[i] < k) {
      count += (k - a[i]) / a[0];
    }
  }
  cout << count << endl;
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}
