#include <bits/stdc++.h>
using namespace std;
int a[100010];
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, k, ans = 0;
    cin >> n >> k;
    for (int i = 0; i < n; i++) cin >> a[i];
    sort(a, a + n);
    for (int i = n - 1; i >= 0; i--) {
      int mm = a[i], g = 0;
      if (mm >= k) {
        ans++;
      } else {
        while (mm * g < k && i >= 0) {
          mm = a[i];
          g++;
          i--;
        }
        i++;
        if (mm * g >= k) ans++;
      }
    }
    cout << ans << endl;
  }
  return 0;
}
