#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = LLONG_MAX;
const long double PI = 3.141592653589793238463;
int main() {
  long long T;
  std::cin >> T;
  while (T--) {
    long long n, x;
    std::cin >> n >> x;
    long long a[n];
    for (long long i = 0; i < (long long)n; i++) std::cin >> a[i];
    sort(a, a + n);
    long long tot = 0;
    long long c = 0;
    for (long long i = n - 1; i >= (long long)0; i--) {
      c++;
      if (c * a[i] >= x) {
        tot++;
        c = 0;
      }
    }
    std::cout << tot << std::endl;
  }
  return 0;
}
