#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
int a[100005];
void solve() {
  int n;
  cin >> n;
  int x;
  cin >> x;
  for (int i = 1; i <= n; i++) cin >> a[i];
  sort(a + 1, a + n + 1, greater<int>());
  int sum = 0, ans = 0;
  for (int i = 1; i <= n; i++) {
    sum++;
    if (sum * a[i] >= x) {
      sum -= x / a[i] + (x % a[i] != 0);
      ans++;
    }
  }
  cout << ans << '\n';
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
