#include <bits/stdc++.h>
using namespace std;
const int Maxn = 2e5 + 30;
const long long Mod = 1e9 + 7;
long long Power(long long a, long long b) {
  long long ans = 1;
  a = a % Mod;
  while (b > 0) {
    if (b % 2 == 1) ans = (ans * a) % Mod;
    b = b / 2;
    a = (a * a) % Mod;
  }
  return ans % Mod;
}
long long a[Maxn];
int main() {
  int T;
  scanf("%d", &T);
  while (T--) {
    long long n, k;
    scanf("%lld%lld", &n, &k);
    for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
    sort(a + 1, a + 1 + n);
    long long sum = 0;
    for (int i = 2; i <= n; i++) sum += (k - a[i]) / a[1];
    printf("%lld\n", sum);
  }
}
