#include <bits/stdc++.h>
const long long INF = LLONG_MAX;
const long long MOD = 1e9 + 7;
const float pi = 3.1415926535897932384626433832795028841971693993751058209749;
using namespace std;
long long prime(long long x) {
  bool flag = 1;
  for (long long i = 2; i * i <= x; i++) {
    if (x % i == 0) {
      flag = 0;
      break;
    }
  }
  return flag;
}
long long gcd(long long r, long long b) {
  long long x = 1;
  while (b != 0) {
    x = b;
    b = r % b;
    r = x;
  }
  return x;
}
long long ansf = 0;
void io() {}
void solve() {
  long long n, k;
  cin >> n >> k;
  vector<long long> v(n);
  for (long long i = 0; i < n; i++) cin >> v[i];
  sort((v).begin(), (v).end());
  long long sum = 0;
  for (long long i = 1; i < n; i++) {
    sum += ((k - v[i]) / v[0]);
  }
  cout << sum << endl;
  return;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
