#include <bits/stdc++.h>
using namespace std;
bool isprime(long long n) {
  for (long long int i = 2; i * i <= n; i++) {
    if (n % i == 0) return 0;
  }
  return 1;
}
long long gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(int a, int b) { return (a / gcd(a, b)) * b; }
long long ncr(long long n, long long k) {
  long long res = 1;
  if (k > n - k) k = n - k;
  for (long long i = 0; i < k; ++i) {
    res *= (n - i);
    res /= (i + 1);
  }
  return res;
}
vector<long long> primefactors(long long n) {
  vector<long long> ans;
  for (long long i = 2; i * i <= n; i++) {
    long long c = 0;
    while (n % i == 0) {
      n = n / i;
      c++;
      ans.push_back(i);
    }
  }
  if (n > 1) ans.push_back(n);
  return ans;
}
bool compare(pair<int, int> a, pair<int, int> b) {
  if (a.second > b.second) return 1;
  return 0;
}
void solve() {
  int n, x;
  cin >> n >> x;
  vector<int> v(n);
  for (int i = 0; i < n; i++) {
    cin >> v[i];
  }
  int teams = INT_MIN;
  sort(v.begin(), v.end());
  vector<int> dp(n + 1, 0);
  for (int i = n - 1; i > -1; i--) {
    int need = ceil((1.0 * x) / v[i]);
    if (i + need > n)
      dp[i] = 0;
    else
      dp[i] = 1 + dp[i + need];
    teams = max(teams, dp[i]);
  }
  cout << teams << endl;
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
