#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n, x;
  cin >> n >> x;
  vector<long long> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a.begin(), a.end());
  int prev = n;
  int ans = 0;
  for (int i = n - 1; i >= 0; i--) {
    long long mn = a[i];
    long long nm = prev - i;
    if (mn * nm >= x) {
      ans++;
      prev = i;
    }
  }
  cout << ans << "\n";
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}
