#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, x;
    cin >> n >> x;
    vector<int> as(n);
    for (int i = 0; i < n; i++) {
      cin >> as[i];
    }
    sort(as.begin(), as.end());
    int j = n;
    int i = n;
    int factor = 1;
    int ans = 0;
    while (j > 0 && i > 0 && factor <= n) {
      while (i > 0 && as[i - 1] >= (x + factor - 1) / factor) i--;
      int dist = j - i;
      int qty = dist / factor;
      ans += qty;
      j -= factor * qty;
      factor++;
    }
    cout << ans << endl;
  }
  return 0;
}
