#include <bits/stdc++.h>
using ll = long long;
using namespace std;

void solve() {
    int n, x; cin >> n >> x;
    int a[n] = {};
    for (int i = 0; i < n; i++)
        cin >> a[i];
    sort(a, a + n);
    int ans = 0;
    ll num = 1;
    for (int i = n - 1; i >= 0; i--) {
        if (num * a[i] >= x) {
            ++ans;
            num = 1;
        } else ++num;
    }
    cout << ans << "\n";
}

int main() {
    int t; cin >> t;
    while (t--) solve();
}