#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  long long x;
  cin >> n >> x;
  long long input[n];
  for (int i = 0; i < n; i++) {
    cin >> input[i];
  }
  sort(input, input + n, greater<long long>());
  int i = 0, j = 0;
  int ans = 0;
  long long minima = INT_MAX;
  while (j < n) {
    minima = input[j];
    long long size = j - i + 1;
    if (minima * size >= x) {
      ans++;
      i = j + 1;
    }
    j++;
  }
  cout << ans << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
