#include <bits/stdc++.h>
using namespace std;
int t, n, mt[100000], m[100000], ti;
long long int x, a[100000];
int f(int i) {
  if (i == n) return 0;
  if (i > n) return -1;
  if (mt[i] == ti) return m[i];
  mt[i] = ti;
  int next = ((x + a[i] - 1) / a[i]) - 1, ans;
  ans = max(1 + f(i + next + 1), f(i + 1));
  m[i] = ans;
  return ans;
}
int main() {
  std::ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  ;
  cin >> t;
  for (ti = 1; ti <= t; ti++) {
    cin >> n >> x;
    for (int i = 0; i < n; i++) cin >> a[i];
    sort(a, a + n);
    cout << f(0) << "\n";
  }
  return 0;
}
