#include <bits/stdc++.h>
using namespace std;
long long binomialCoeff(long long n, long long k) {
  long long res = 1;
  if (k > n - k) k = n - k;
  for (long long i = 0; i < k; ++i) {
    res *= (n - i);
    res /= (i + 1);
  }
  return res;
}
struct MyComp {
  bool operator()(const pair<int, int>& x, const pair<int, int>& y) const {
    return x.second > y.second || (x.second == y.second && x.first > y.first);
  }
};
long long M = 1e9 + 7;
long long mods(long long a, long long b) {
  a = a % M;
  b = b % M;
  return (a + b) % M;
}
long long modp(long long a, long long b) {
  a = a % M;
  b = b % M;
  return (a * b) % M;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) {
    int n, x;
    cin >> n >> x;
    vector<long long> v(n);
    for (int i = 0; i < n; i++) {
      cin >> v[i];
    }
    sort(v.begin(), v.end());
    int ans = 0;
    long long count = 0;
    for (int i = n - 1; i >= 0; i--) {
      count += 1;
      if (count * v[i] >= x) {
        ans += 1;
        count = 0;
      }
    }
    cout << ans << endl;
  }
}
