#include <bits/stdc++.h>

using namespace std;

int main() {
    int T;
    cin >> T;

    while (T--) {
        int n, k;
        cin >> n >> k;

        vector<int> d(n);
        vector<bool> taken(n, false);
        for (int i = 0; i < n; i++)
        {
            cin >> d[i];
        }
        
        sort(d.begin(), d.end());

        int s = 0, l = 0;
        for (int i: d) {
            (i < k ? s : l)++;
        }

        int i = 0;
        int j = n - 1;
        int t = 0;
        while (i < j && s > l) {
            while (j >= 0 && (d[i] + d[j] >= k)) j--;
            if (i < j) {
                t++;
                s -= 2;
                if (l) l -= 1; else s--;
            }
            i++, j--;
        }
        
        if (s <= 0 && l == 0) {
            cout << t - 1 << "\n";
        } else {
            cout << t - 1 + (s > l ? (s + l + 1) / 2 : l) << "\n";
        }
    }
}