#include <bits/stdc++.h>
using namespace std;
const long long int N = 200006;
long long int power2(long long int x, long long int n) {
  long long int m;
  if (n == 0) return 1;
  if (n % 2 == 0) {
    m = power2(x, n / 2);
    return (m * m) % 998244353;
    ;
  } else
    return (x * (power2(x, n - 1))) % 998244353;
  ;
}
void solve() {
  long long int i, j, k, q;
  long long int n;
  long long int mn = 1e13, r = 0, x, y;
  cin >> n >> k;
  long long int a[n];
  long long int tm = 0;
  for (i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  long long int l = 0;
  for (i = n - 1; i >= 0; i--) {
    l = l + 1;
    if (l == 1)
      mn = a[i];
    else
      mn = min(mn, a[i]);
    if (mn * l >= k) tm++, l = 0;
  }
  cout << tm;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int tt = 1.0 * clock();
  int t;
  cin >> t;
  for (int y = 0; y < t; y++) {
    solve();
    cout << endl;
  }
}
