#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n, x;
  cin >> n >> x;
  deque<long long> a;
  for (long long i = 0; i < n; ++i) {
    long long ai;
    cin >> ai;
    a.push_back(ai);
  }
  sort(a.begin(), a.end());
  reverse(a.begin(), a.end());
  long long la = -1;
  long long ans = 0;
  for (long long i = 0; i < n; i++) {
    if (a[i] * (i - la) >= x) {
      la = i;
      ++ans;
    }
  }
  cout << ans << '\n';
}
int main() {
  ios::sync_with_stdio(false), cin.tie(nullptr);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
