#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    int n, x;
    scanf("%d", &n), scanf("%d", &x);
    int a[n];
    for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
    sort(a, a + n);
    int ans;
    int p = lower_bound(a, a + n, x) - a;
    ans = n - p;
    for (int i = p - 1, c = 0; i >= 0; --i) {
      ++c;
      if (1LL * c * a[i] >= 1LL * x) {
        c = 0;
        ++ans;
      }
    }
    cout << ans << '\n';
  }
  return 0;
}
