#include <bits/stdc++.h>
using namespace std;
const int oo = 1e9 + 9;
const long long inf = 1e18 + 18;
const int max6 = 1e6 + 6;
const int modx = 1e9 + 7;
const int mody = 997;
const int base = 137;
int n, first;
int a[max6];
long long f[max6], dd[max6];
int up(int a, int b) {
  int res = a / b;
  res += b * res < a;
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  int t;
  cin >> t;
  while (t--) {
    cin >> n >> first;
    for (int i = 1; i <= n; ++i) cin >> a[i];
    sort(a + 1, a + n + 1);
    for (int i = 1; i <= n; ++i) f[i] = dd[i] = 0;
    long long gmax = 0;
    for (int i = 1; i <= n; ++i) {
      int id = min(up(first, a[i]) + i - 1, n + 1);
      dd[id] = max(dd[id], f[i - 1] + 1);
      gmax = max(gmax, dd[i]);
      f[i] = gmax;
    }
    cout << f[n] << "\n";
  }
}
