#include <bits/stdc++.h>
using namespace std;
vector<int> dx = {-1, 0, 0, 1};
vector<int> dy = {0, -1, 1, 0};
const int Mod = (int)((int)1e9 + 7);
void solve() {
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  int ans = 0;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a.begin(), a.end());
  for (int i = 1; i < n; i++) {
    while (a[i] + a[0] <= k) {
      a[i] += a[0];
      ans++;
    }
  }
  cout << ans << endl;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int q = 1;
  cin >> q;
  for (int i = 1; i <= q; i++) {
    solve();
  }
}
