#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
struct hash_pair {
  template <class T1, class T2>
  size_t operator()(const pair<T1, T2>& p) const {
    auto hash1 = hash<T1>{}(p.first);
    auto hash2 = hash<T2>{}(p.second);
    return hash1 ^ hash2;
  }
};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int testcases = 1;
  cin >> testcases;
  int t = testcases;
  while (testcases--) {
    int n, x;
    cin >> n >> x;
    int a[n];
    for (int i = 0; i < n; i++) {
      cin >> a[i];
    }
    sort(a, a + n);
    int c = 0;
    int idx = lower_bound(a, a + n, x) - a;
    c += n - idx;
    vector<int> dp(idx, 0);
    int ans = 0;
    for (int i = idx - 1; i >= 0; i--) {
      int req = x / a[i];
      if (x % a[i] != 0) req++;
      int next = i + req;
      if (i + req - 1 >= idx) continue;
      dp[i]++;
      if (next < idx) dp[i] += dp[next];
      ans = max(ans, dp[i]);
    }
    c += ans;
    cout << c << endl;
  }
  return 0;
}
