#include <bits/stdc++.h>
using namespace std;
void boost() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
const long long mod = 1000000007;
int tablica[2];
long long potega(long long base, long long pot) {
  if (pot == 0) return 1;
  if (pot == 1) return base;
  if (pot % 2 == 0) {
    long long res = potega(base, pot / 2);
    return ((res * res) % mod);
  } else
    return ((potega(base, pot - 1) * base) % mod);
}
int bs(int pocz, int kon, int szu) {
  int sr;
  while (pocz < kon) {
    sr = (pocz + kon) / 2;
    if (tablica[sr] >= szu)
      kon = sr;
    else
      pocz = sr + 1;
  }
  return pocz;
}
int n, k, a[1007], ile;
void reset_arrays() { ile = 0; }
void solve() {
  reset_arrays();
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  sort(a, a + n);
  for (int i = 1; i < n; i++) {
    int pom = (k - a[i]) / a[0];
    ile += pom;
  }
  printf("%d\n", ile);
}
int main() {
  int t = 1;
  scanf("%d", &t);
  while (t--) solve();
  return 0;
}
