#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e18;
const string nl = "\n";
long long n, k, ans, hld;
deque<long long> a;
void solve() {
  cin >> n >> k;
  a.resize(n);
  for (auto& i : a) {
    cin >> i;
  }
  ans = hld = 0;
  sort(a.rbegin(), a.rend());
  for (long long i = 0; i < n; ++i) {
    ++hld;
    if (hld * a[i] >= k) {
      ++ans;
      hld = 0;
    }
  }
  cout << ans << nl;
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(nullptr);
  long long T;
  cin >> T;
  while (T--) {
    solve();
  }
}
