#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 100000 + 10;
int n, m, ans;
int a[maxn];
void print(int a[], int n, int st = 0) {
  for (int i = 0; i < n; i++) {
    if (i != 0) printf(" ");
    printf("%d", a[i + st]);
  }
  printf("\n");
}
void init() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
}
void doit() {
  sort(a, a + n);
  ans = 0;
  int cnt = 0;
  for (int i = n - 1; i >= 0; i--) {
    cnt++;
    if ((long long)a[i] * cnt >= m) {
      ans++;
      cnt = 0;
    }
  }
  printf("%d\n", ans);
}
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    init();
    doit();
  }
  return 0;
}
