#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  while (t--) {
    long int n, x, pos = 1;
    cin >> n >> x;
    long int* a = new long int[n];
    for (auto i = 0; i < n; i++) {
      cin >> a[i];
      if (a[i] > x) {
        a[i] = 0;
      } else {
        if (x % a[i] == 0) {
          a[i] = x / a[i];
        } else {
          a[i] = ((x / a[i]) + 1);
        }
      }
    }
    sort(a, a + n);
    int count = 0;
    for (auto i = 0; i < n;) {
      if (a[i] <= pos && pos >= 1) {
        count++;
        i++;
        pos = 1;
      } else {
        i++;
        pos++;
      }
    }
    cout << count << endl;
  }
  return 0;
}
