#include <bits/stdc++.h>
using namespace std;
long long n, t, k;
int main() {
  cin >> t;
  while (t--) {
    cin >> n;
    cin >> k;
    vector<long long> a(n);
    for (long long i = 0; i < n; i++) cin >> a[i];
    sort((a).begin(), (a).end(), greater<long long>());
    int sol = 0;
    int cmin;
    long long len = 0;
    for (long long i = 0; i < n; i++) {
      cmin = a[i];
      len++;
      if (cmin * len >= k) {
        sol++;
        len = 0;
      }
    }
    cout << sol << endl;
  }
}
