#include <bits/stdc++.h>
using namespace std;
int a[100005], t, n, x;
int main() {
  scanf("%d", &t);
  while (t--) {
    scanf("%d%d", &n, &x);
    for (int i = 0; i < n; ++i) scanf("%d", a + i);
    a[n] = 0;
    sort(a, a + n, greater<int>());
    int ans = 0, i = 0, now = 1;
    while (i < n) {
      while (i < n && 1ll * now * a[i] < x) ++i, ++now;
      if (1ll * now * a[i] >= x) ++ans;
      ++i, now = 1;
    }
    printf("%d\n", ans);
  }
}
