#include <bits/stdc++.h>
using namespace std;
const long long int infl = 0x3f3f3f3f3f3f3f3fLL;
vector<long long int> adj[1001];
long long int vis[1001], k;
int main() {
  int t;
  cin >> t;
  while (t--) {
    long long int n, ans = infl, num, b, c, d, x, k, y, z, w, r, p, q, f = 0,
                     i = 0, j = 0, mid, r1, r2, c1, c2;
    long long int sum = 0, sum1 = 0, sum2 = 0, res = 0, cur, l, maxm = -infl,
                  minm = infl, low, high = 0;
    string s1, s2, s, s3, str, v;
    cin >> n >> k;
    long long int a[n], pos;
    for (i = 0; i < n; i++) cin >> a[i];
    sort(a, a + n);
    sum = 0;
    for (i = 1; i < n; i++) {
      sum += (k - a[i]) / a[0];
    }
    cout << sum;
    cout << endl;
  }
}
