#include <bits/stdc++.h>
using namespace std;
void solve(long long int arr[], long long int n, long long int x) {
  reverse(arr, arr + n);
  long long int ans = 0, idx = 0, flag = 0;
  for (long long int i = 0; i < n; i++) {
    if (arr[i] >= x) {
      ans++;
    } else {
      flag = 1;
      idx = i;
      break;
    }
  }
  if (flag == 1) {
    long long int cnt = 2;
    for (long long int i = idx + 1; i < n; i++) {
      if (arr[i] * cnt >= x) {
        ans++;
        cnt = 1;
      } else {
        cnt++;
      }
    }
  }
  cout << ans << "\n";
}
int32_t main() {
  long long int t;
  cin >> t;
  while (t--) {
    long long int n, x;
    cin >> n >> x;
    long long int arr[n];
    for (long long int i = 0; i < n; i++) {
      cin >> arr[i];
    }
    sort(arr, arr + n);
    solve(arr, n, x);
  }
  return 0;
}
