#include <bits/stdc++.h>
using namespace std;
int main() {
  long long t;
  cin >> t;
  while (t-- > 0) {
    long long n, x;
    cin >> n >> x;
    vector<long long> a(n);
    for (long long i = 0; i < n; i++) cin >> a[i];
    sort(a.begin(), a.end());
    long long m = 0;
    long long ans = 0;
    for (long long i = n - 1; i >= 0; i--) {
      m++;
      if (ceil(x / (double)a[i]) <= m) {
        ans++;
        m = m - ceil(x / (double)a[i]);
      }
    }
    cout << ans << endl;
  }
  return 0;
}
