#include "bits/stdc++.h"
using namespace std;
#define all(x) x.begin(), x.end()
void solve() {
    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    sort(all(a));
    int t = n - 1;
    int rs = 0;
    vector<int> ex(n, 1);
    for (int i = 0; i < n; ++i) {
        if ((rs+1) * 3 > n)
            break;
        while (t > i and (a[t] + a[i] >= k or ex[t] == 0))
            t--;
        if (t > i) {
            rs++;
            ex[t] = 0;
            ex[i] = 0;
        }
    }
    int ans = 0;
    for (int i = n-1; i >= 0; --i) {
        if (ex[i] and rs > 0) {
            rs--;
            ans++;
            ex[i] = 0;
        }
    }
    int t0 = 0;
    int t1 = 0;
    for (int i = 0; i < n; ++i) {
        if (ex[i]) {
            if (a[i] >= k)
                t1++;
            else
                t0++;
        }
    }
    while (t0 > 0 and t0 + t1 > 1) {
        t0--;
        ans++;
        if (t1 != 0)
            t1--;
        else
            t0--;
    }
    if (t0) {
        ans++;
    }
    if (t1) {
        ans += t1;
    }
    cout << ans - 1 << '\n';
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
}