#include <bits/stdc++.h>
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
const int MOD = 1e12 + 7;
const int MAX = 1e6 + 2;
const int INF = 0x3f3f3f3f;
using namespace std;
long long a[1000001], n, k;
int main() {
  long long t;
  cin >> t;
  while (t--) {
    long long ans = 0;
    cin >> n >> k;
    for (long long i = 1; i <= n; i++) cin >> a[i];
    sort(a + 1, a + n + 1);
    for (long long i = 2; i <= n; i++) ans += (k - a[i]) / a[1];
    cout << ans << endl;
  }
  return 0;
}
