#include <bits/stdc++.h>
using namespace std;
int main() {
  int t, n, k;
  cin >> t;
  while (t--) {
    cin >> n >> k;
    long long int a[n];
    for (int i = 0; i < n; i++) {
      cin >> a[i];
    }
    sort(a, a + n);
    int small = a[0];
    long long int count = 0;
    for (int i = 1; i < n; i++) {
      long long int diff = (k - a[i]);
      count += diff / small;
    }
    cout << count << endl;
  }
  return 0;
}
