#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
signed main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int64_t t;
  cin >> t;
  while (t--) {
    int64_t n;
    cin >> n;
    int64_t x;
    cin >> x;
    vector<int64_t> v(n);
    for (int64_t i = 0; i < n; ++i) {
      cin >> v[i];
    }
    sort(v.begin(), v.end(), greater<int64_t>());
    int64_t counter{};
    --n;
    for (int64_t i = 0; i <= n;) {
      int64_t min_skill = v[i];
      int64_t company = 0;
      while (i <= n && min_skill * company < x) {
        min_skill = min(min_skill, v[i]);
        ++company;
        ++i;
      }
      if (company * min_skill < x) {
        break;
      } else {
        counter++;
      }
    }
    cout << counter << '\n';
  }
  return 0;
}
