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


int n;
int t;

int k;

int pairs;
int smalls;
int bigs;

vector <int> a;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    cin >> t;
    while(t--)
    {
        cin >> n >> k;

        pairs=smalls=bigs=0;

        a.resize(n);

        for(int i=0;i<n;i++)
        {
            cin >> a[i];
        }

        sort(a.begin(),a.end());

        a.pop_back();
        n--;

        int ans=0;

        int l=0;
        int r=n-1;

        while(l<=r)
        {
            if(a[r]>=k)
            {
                bigs++;
                r--;
                continue;
            }

            if(l==r)
            {
                smalls++;
                r--;
                continue;
            }

            if(a[l]+a[r]>=k)
            {
                smalls++;
                r--;
                continue;
            }

            pairs++;
            l++;
            r--;
        }

        while(pairs || smalls || bigs)
        {
            if(pairs and bigs)
            {
                ans++;
                pairs--;
                bigs--;
                continue;
            }

            if(smalls and bigs)
            {
                ans++;
                smalls--;
                bigs--;
                continue;
            }

            if(bigs)
            {
                bigs--;
                ans++;
                continue;
            }

            if(pairs and smalls)
            {
                pairs--;
                smalls--;
                ans++;
                continue;
            }

            if(smalls)
            {
                ans+=(smalls)/2;
                smalls=0;
            }

            if(pairs)
            {
                ans+=(pairs*2)/3;
                pairs=0;
            }
        }

        cout << ans << "\n";
    }
}