#include <bits/stdc++.h>
using namespace std;
int main() {
  int test;
  scanf("%d", &(test));
  for (int t = 1; t <= test; t++) {
    long long int x, n, cnt = 0;
    scanf("%lld", &(n)), scanf("%lld", &(x));
    long long int a[n + 5];
    for (int i = 1; i <= n; i++) scanf("%lld", &(a[i]));
    sort(a + 1, a + n + 1);
    reverse(a + 1, a + n + 1);
    long long int tot = 0;
    for (int i = 1; i <= n; i++) {
      int dif = i - cnt;
      long long int val = (a[i] + x - 1) / a[i];
      if (dif >= val) {
        tot++;
        cnt = i;
      }
    }
    cout << tot << endl;
  }
  return 0;
}
