#include <bits/stdc++.h>
using namespace std;
void solve(vector<int> A, int k) {
  int n = A.size();
  sort(A.begin(), A.end());
  int cnt = 0;
  for (int i = 1; i < n; i++) {
    while (A[i] + A[0] <= k) {
      A[i] += A[0];
      cnt++;
    }
  }
  cout << cnt << '\n';
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, k;
    cin >> n >> k;
    vector<int> A(n);
    for (int i = 0; i < n; i++) {
      cin >> A[i];
    }
    solve(A, k);
  }
}
