#include<stdio.h>

int n, t, max;

typedef struct
{
  int a, b, c;
} cutie;

cutie v[3600];

void calcul()
{
  freopen("cutii.in","r",stdin);
  freopen("cutii.out","w",stdout);
  scanf ("%d %d", &n, &t);
  int i, j, contor;
  for (j=1; j<=t; j++)
    {
      max=0;
      for (i=1; i<=n; i++)
	scanf("%d %d %d", &v[i].a, &v[i].b,&v[i].c);
      int k ,l, contor=0;
      for (k=1; k<n; k++)
	for (l=k+1; l<=n; l++)
	  if (v[k].a<v[l].a && v[k].b<v[l].b && v[k].c<v[l].c)
	    {
	      contor++;
	      k=l;
	    }
      contor++;
      max=contor;
      contor=0;
      for (k=n; k>1; k--)
	for (l=k-1; l>=1; l--)
	  if (v[k].a>v[l].a && v[k].b>v[l].b && v[k].c>v[l].c)
	    {
	      contor++;
	      k=l;
	    }
      if (max<contor) max=contor;
      printf("%d\n",max);
    }
}

int main()
{
  calcul();
  return 0;
}