#include<fstream.h>

int n, g, a[1000], contor;

void BubleSort()
{
  int i, ok, aux;
  do
     {
       ok=1;
       for (i=1; i<n; i++)
	 if (a[i]>a[i+1])
	   {
	     aux=a[i];
	     a[i]=a[i+1];
	     a[i+1]=aux;
	     ok=0;
	   }
     } while (!ok);
}


void prelucrare()
{
  ifstream in("zebughil.in");
  ofstream out("zebughil.out");
  for (int e=1; e<=3; e++)
    {
      contor=0;
      int i, j;
      in>>n>>g;
      for (i=1; i<=n; i++)
	in>>a[i];
      BubleSort();
      while (a[n]==g)
	{
	  n--;
	  contor++;
	}
      int p, u;
      p=1; u=n;
      while (p<=u)
	{
	  int s;
	  s=a[u]+a[p];
	  if (s>g)
	    {
	      u--;
	      contor++;
	    }
	   else
	     {
	       p++;
	       u--;
	       contor++;
	     }
	 // if (u==p) contor++;
	}
      out<<contor<<'\n';
    }
}

int main()
{


  prelucrare();
  return 0;
}