#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
const int M = 1e6 + 10;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
int a[N];
void solve() {
  int n, k;
  cin >> n >> k;
  for (long long i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  int ans = 0;
  for (long long i = 1; i < n; i++) a[i] = k - a[i];
  for (long long i = 1; i < n; i++) {
    int u = a[i] / a[0], v = a[i] % a[0];
    ans += u;
    if (v > a[0]) ans++;
  }
  cout << ans << endl;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  ;
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
