#include <stdio.h>
void sortare(int n,int a[3501],int b[3501],int c[3501])
{
	int i,pmin,aux,aux3,aux2,j;
	for (i=1; i<n; i++)
	{
		pmin=i;
		for (j=i+1; j<=n; j++)
			if (a[j]<a[pmin])
				pmin=j;
		if (i!=pmin)
		{
			aux=a[i];
			aux2=b[i];
			aux3=c[i];
			a[i]=a[pmin];
			b[i]=b[pmin];
			c[i]=c[pmin];
			a[pmin]=aux;
			b[pmin]=aux2;
			c[pmin]=aux3;
		}
	}
}
int main()
{
	freopen("cutii.in","r",stdin);
	freopen("cutii.out","w",stdout);
	int n,t,i,a[3501],b[3501],c[3501],max,maxc,j,ant,post;
	scanf("%d%d",&n,&t);
	while (t--)
	{
		ant=0;
		max=0;
		for (i=1; i<=n; i++)
			scanf("%d%d%d",&a[i],&b[i],&c[i]);
		sortare(n,a,b,c);
		for (i=1; i<n; i++)
		{
			ant=i;
			maxc=1;
			for (j=i+1; j<=n; j++)
			{
				if (b[j]>=b[ant] && c[j]>=c[ant])
				{
					maxc++;
					ant=j;
				}
			}
			if (maxc>max)
				max=maxc;
		}
		printf("%d\n",max);
	}
	return 0;
}