#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9, MOD = INF + 7, MININT = -2147483648, MAXINT = 2147483647;
int main() {
  int casos;
  cin >> casos;
  while (casos--) {
    int n, k;
    cin >> n >> k;
    vector<int> v(n);
    for (auto& i : v) cin >> i;
    int nin = v[0];
    for (int const& i : v) nin = min(nin, i);
    int sol = 0;
    for (int i = 0; i < n; ++i) {
      if (k - v[i] > 0) sol += (k - v[i]) / nin;
    }
    sol -= (k - nin) / nin;
    cout << sol << '\n';
  }
  return 0;
}
