#include <bits/stdc++.h>
using namespace std;
const long long t9p7 = 1000000007;
void soln(long long t) {
  long long m, n, k, a, b, c, cnt = 0, ans = 0, mn = LONG_LONG_MAX,
                              mx = LONG_LONG_MIN;
  string str;
  cin >> n >> k;
  vector<long long> arr(n + 1, 0), dp(n + 1, 0);
  for (long long(i) = (0); (i) < (n); (i)++) {
    cin >> arr[i];
  }
  sort((arr).begin(), (arr).end());
  mx = 0;
  for (long long(i) = (1); (i) < (n + 1); (i)++) {
    a = ceil((long double)k / (long double)arr[i]);
    a = i + a - 1;
    if (dp[i] < dp[i - 1]) dp[i] = dp[i - 1];
    if (a <= n) {
      dp[a] = max(dp[a], dp[i - 1] + 1);
      mx = max(mx, dp[a]);
    }
  }
  cout << mx << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  long long t = 1;
  cin >> t;
  while ((t)--) soln(t);
  return 0;
}
