#include <bits/stdc++.h>
using namespace std;
long long dp[100008];
long long work(vector<long long> &a, long long &n, long long &x, long long i) {
  if (i > n) return -0x3f3f3f3f;
  if (i == n) return 0;
  if (dp[i] != -1) return dp[i];
  if (a[i] >= x) return dp[i] = work(a, n, x, i + 1) + 1;
  long long y = x / a[i];
  if (x % a[i]) y += 1;
  return dp[i] = (work(a, n, x, i + 1) > work(a, n, x, i + y) + 1
                      ? work(a, n, x, i + 1)
                      : work(a, n, x, i + y) + 1);
}
void solve() {
  long long x, n;
  cin >> n >> x;
  vector<long long> a(n);
  {
    int n11 = a.size();
    for (int i1 = 0; i1 < n11; i1++) cin >> a[i1];
  };
  sort(a.begin(), a.end());
  memset(dp, -1, sizeof(dp));
  cout << work(a, n, x, 0) << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
