#include <bits/stdc++.h>
using namespace std;
const long long mod = (long long)1e9 + 7;
const long long maxn = (long long)15e6 + 1100;
const int nnn = 664579 + 500;
const int inf = numeric_limits<int>::max() - 1;
const long long INF = 1e18;
long long dx[] = {0, 1, 0, -1};
long long dy[] = {1, 0, -1, 0};
long long dxx[] = {0, 1, 0, -1, 1, 1, -1, -1};
long long dyy[] = {1, 0, -1, 0, 1, -1, 1, -1};
void solve() {
  long long n, x;
  cin >> n >> x;
  long long a[n + 5];
  for (int i = 1; i <= (n); i++) cin >> a[i];
  long long ans = 0;
  long long l = 1, r = n;
  bool ok = 0;
  long long num = 0;
  sort(a + 1, a + n + 1);
  while (r >= 1) {
    num++;
    if (num * a[r] >= x) ans++, num = 0;
    r--;
  }
  cout << ans << '\n';
  return;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long T;
  T = 1;
  cin >> T;
  long long CT = 0;
  while (T--) {
    solve();
  }
  return 0;
}
