#include <bits/stdc++.h>
using namespace std;
vector<int> v;
int dp[100005];
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, x;
    cin >> n >> x;
    v.clear();
    for (int i = 1; i <= n; i++) {
      int a;
      cin >> a;
      int k = x / a;
      if (x % a > 0) k++;
      v.push_back(k);
    }
    sort(v.begin(), v.end());
    for (int i = 0; i < v.size(); i++) {
      dp[i] = dp[i - 1];
      if (i + 1 >= v[i]) dp[i] = max(dp[i], dp[i - v[i]] + 1);
    }
    int ans = 0;
    cout << dp[n - 1] << endl;
    for (int i = 0; i < n; i++) dp[i] = 0;
  }
}
