#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n, x, cnt = 0;
  cin >> n >> x;
  vector<int> v(n);
  vector<int> small;
  for (int i = 0; i < n; i++) {
    cin >> v[i];
    if (v[i] >= x)
      cnt++;
    else
      small.push_back(v[i]);
  }
  sort(small.begin(), small.end());
  long long mi = INT_MAX;
  int c = 0;
  for (int i = small.size() - 1; i >= 0; i--) {
    c++;
    mi = min(mi, 1LL * small[i]);
    if ((mi * c) >= x) {
      c = 0;
      cnt++;
      mi = INT_MAX;
    }
  }
  cout << cnt << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int T = 1;
  cin >> T;
  while (T--) {
    solve();
  }
}
