#include<iostream>

 #include<algorithm>

 using namespace std;

 const int maxn =  + ;

 int n, m;

 int a[maxn];

 int ans;

 void solve()

 {

     ans = ;

     sort(a, a + n);

     int L = , R = n - ;

     while (L <= R)

     {

         if (a[L] + a[R] <= m)

         {

             ans++;

             L++;

             R--;

         }

         else

         {

             ans++;

             R--;

         }

     }

 }

 int main()

 {

     //freopen("D:\\txt.txt", "r", stdin);

     int t;

     cin >> t;

     while (t--)

     {

         cin >> n >> m;

         for (int i = ; i < n; i++)

         {

             cin >> a[i];

         }

         solve();

         cout << ans << endl;

         if (t)  cout << endl;

     }

     return ;

 }