#include <bits/stdc++.h>
using namespace std;
bool compare(long long int a, long long int b) { return a > b; }
int32_t main() {
  int t;
  cin >> t;
  while (t--) {
    long long int n, x;
    cin >> n >> x;
    long long int a[n + 1];
    a[0] = 0;
    for (int i = 1; i < n + 1; i++) {
      cin >> a[i];
      a[i] = (x / a[i]) + ((x % a[i]) != 0 ? 1 : 0);
    }
    sort(a, a + n + 1);
    long long int dp[n + 1];
    dp[0] = 0;
    for (int i = 1; i < n + 1; i++) {
      long long int p = i - a[i];
      long long int z = 1;
      if (p < 0) {
        z = 0;
        p = 0;
      }
      dp[i] = max(dp[i - 1], z + dp[p]);
    }
    cout << dp[n] << endl;
  }
}
