#include <bits/stdc++.h>

using namespace std;
const int c=200005;
int n, k, ans, t[c];
bool kesz[c];

void solve() {
    cin >> n >> k;
    for (int i=1; i<=n; i++) {
        cin >> t[i];
    }
    sort(t+1, t+n+1);
    int pos=n, pos2=n;
    for (int i=1; i<=n; i++) {
        if (kesz[i]) continue;
        while (pos>0 && (kesz[pos] || t[i]+t[pos]>=k)) pos--;

        kesz[i]=1;
        if (pos>i) kesz[pos]=1;

        while (pos2 && kesz[pos2]) pos2--;
        if (t[i]<k && pos2) kesz[pos2]=1;

        ans++;
    }

    cout << ans-1 << "\n";

    ans=0;
    for (int i=0; i<=n; i++) {
        kesz[i]=0;
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    int w;
    cin >> w;
    while (w--) {
        solve();
    }
    return 0;
}