#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n, k;
  cin >> n >> k;
  long long a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  long long sum = 0;
  long long index = n;
  for (int i = 0; i < n; i++) {
    if (a[i] >= k) {
      sum += n - i;
      index = i;
      break;
    }
  }
  long long count = 1;
  for (long long i = index - 1; i >= 0; i--) {
    if (count * a[i] >= k) {
      sum += 1;
      count = 1;
    } else
      count++;
  }
  cout << sum << endl;
  return;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  long long t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
