#include <bits/stdc++.h>
using namespace std;
int T, n, m, a[100005], f[100005];
void u(int &x, int y) {
  if (y > x) x = y;
}
int main() {
  scanf("%d", &T);
  while (T--) {
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; ++i) scanf("%d", a + i), f[i] = 0;
    sort(a + 1, a + n + 1);
    for (int i = 1; i <= n; ++i) {
      if (a[i] >= m)
        f[i] = f[i - 1] + 1;
      else {
        int _ = i + (m - 1) / a[i];
        if (_ <= n) u(f[_], f[i - 1] + 1);
        u(f[i], f[i - 1]);
      }
    }
    printf("%d\n", f[n]);
  }
  return 0;
}
