#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
  int t = 1;
  scanf("%d", &t);
  while (t--) {
    int n, k;
    scanf("%d %d", &n, &k);
    vector<int> a(n);
    for (int &i : a) scanf("%d", &i);
    sort(a.rbegin(), a.rend());
    int cnt = 0, pr = 0, mn = 1e9;
    for (int i = 0; i < n; i++) {
      if (a[i] >= k) {
        cnt++, pr = i + 1;
      } else {
        mn = min(mn, a[i]);
        if (mn * (i - pr + 1) >= k) cnt++, pr = i + 1;
      }
    }
    cout << cnt << endl;
  }
  return 0;
}
