#include <bits/stdc++.h>
using namespace std;
long long int mod = 1000000007;
long long int INF64 = mod * mod + 1;
void solve() {
  long long int n, x;
  cin >> n >> x;
  priority_queue<long long int> pq;
  while (n--) {
    long long int a;
    cin >> a;
    pq.push(a);
  }
  long long int ans = 0, curr = 0, currmin;
  while (!pq.empty()) {
    if (curr * currmin < x) {
      currmin = pq.top();
      pq.pop(), curr++;
    } else {
      ans++;
      curr = 0;
    }
  }
  ans += (curr * currmin >= x);
  cout << ans << '\n';
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int T = 1;
  cin >> T;
  for (long long int i = 1; i <= T; i++) {
    solve();
  }
  cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC
       << "ms\n";
}
