#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int t, n, x, temp;
  cin >> t;
  while (t--) {
    cin >> n;
    cin >> x;
    vector<long long int> vect;
    for (long long int i = 0; i < n; i++) {
      cin >> temp;
      vect.push_back(temp);
    }
    sort(vect.begin(), vect.end());
    long long int counter = 0;
    long long int ans = 0;
    for (long long int i = n - 1; i >= 0; i--) {
      if (vect[i] >= x) {
        ans++;
        counter = 0;
      } else if ((counter + 1) * vect[i] >= x) {
        counter = 0;
        ans++;
      } else {
        counter++;
      }
    }
    cout << ans << endl;
  }
}
