#include <bits/stdc++.h>
using namespace std;
int main() {
  int T;
  cin >> T;
  while (T--) {
    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    int min_a = k, idx = -1;
    for (int i = 0; i < n; i++) {
      cin >> a[i];
      if (a[i] <= min_a) {
        min_a = a[i];
        idx = i;
      }
    }
    long long spells = 0;
    for (int i = 0; i < n; i++) {
      if (i == idx) continue;
      spells += (k - a[i]) / min_a;
    }
    cout << spells << endl;
  }
  return 0;
}
