#include <bits/stdc++.h>
using namespace std;
int t, n, k, a[1010];
int main() {
  cin >> t;
  while (t--) {
    cin >> n >> k;
    for (register int i = 1; i <= n; ++i) cin >> a[i];
    sort(a + 1, a + n + 1);
    int cnt = 0;
    for (register int i = 2; i <= n; ++i)
      while (a[i] + a[1] <= k) ++cnt, a[i] += a[1];
    cout << cnt << endl;
    memset(a, 0, sizeof(a));
  }
  return 0;
}
