#include <bits/stdc++.h>
using namespace std;
const long long int N = 2e5 + 5;
void solve() {
  long long int n, x;
  cin >> n >> x;
  vector<long long int> v(n);
  for (auto &it : v) cin >> it;
  ;
  sort(v.begin(), v.end());
  long long int ans = 0;
  vector<long long int> a;
  for (long long int i = 0; i < n; i++) {
    if (v[i] >= x) {
      ans++;
    } else {
      a.push_back(v[i]);
    }
  }
  reverse(a.begin(), a.end());
  for (long long int i = 0; i < a.size(); i++) {
    long long int mini = a[i];
    long long int count = 1;
    while (mini * count < x) {
      i++;
      if (i >= a.size()) {
        break;
      }
      mini = min(mini, a[i]);
      count++;
    }
    if (mini * count >= x) {
      ans++;
    }
  }
  cout << ans << "\n";
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int t = 1;
  cin >> t;
  while (t--) solve();
  return 0;
}
