#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
const int INFMEM = 63;
const int INF = 1061109567;
const long long LINF = 4557430888798830399LL;
const double DINF = numeric_limits<double>::infinity();
const long long MOD = 1000000007;
const int dx[8] = {0, 0, 1, -1, 1, -1, 1, -1};
const int dy[8] = {1, -1, 0, 0, 1, -1, -1, 1};
const char dch[4] = {'R', 'L', 'D', 'U'};
const double PI = 3.141592653589793;
inline void open(string a) {
  freopen((a + ".in").c_str(), "r", stdin);
  freopen((a + ".out").c_str(), "w", stdout);
}
inline void fasterios() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
long long n, k;
long long isi[100005];
long long memo[100005];
long long ceil(long long a, long long b) { return (a - 1) / b + 1; }
int main() {
  fasterios();
  int testCases;
  cin >> testCases;
  int tc = 0;
  while (++tc <= testCases) {
    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> isi[i];
    sort(isi + 1, isi + 1 + n);
    memo[n + 1] = 0;
    long long ans = 0;
    for (int i = n; i >= 1; i--) {
      long long cur = ceil(k, isi[i]);
      memo[i] = 0;
      if (i + cur - 1 > n) continue;
      memo[i] = 1 + memo[i + cur];
      ans = max(ans, memo[i]);
    }
    cout << ans << '\n';
  }
  return 0;
}
