#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n, k;
  cin >> n >> k;
  int mini1 = INT_MAX;
  vector<int> v;
  int index = -1;
  int ans = 0;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    if (x <= mini1) {
      mini1 = x;
      index = v.size();
    }
    if (x < k) v.push_back(x);
  }
  for (int i = 0; i < v.size(); i++) {
    ans += (k - v[i]) / mini1;
  }
  ans -= (k - mini1) / mini1;
  cout << ans << endl;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    solve();
  }
  return 0;
}
