#include <bits/stdc++.h>
using namespace std;
long long seive[1000001];
void buildseive() {
  for (int i = 0; i < 1000001; i++) seive[i] = 1;
  for (int i = 2; i * i < 1000001; i++) {
    if (seive[i]) {
      for (int j = i; j * i < 1000001; j++) {
        seive[i * j] = 0;
      }
    }
  }
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    long long n, x;
    cin >> n >> x;
    long long arr[n];
    for (int i = 0; i < n; i++) cin >> arr[i];
    int count = 0;
    sort(arr, arr + n);
    int grp = 0;
    for (int i = n - 1; i >= 0; i--) {
      long long z;
      z = (x / arr[i]) + (x % arr[i] != 0 ? 1 : 0);
      if (count + 1 >= z) {
        grp++;
        count = 0;
      } else
        count++;
    }
    cout << grp << endl;
  }
}
