#include <cstdio>
#include <algorithm>
using namespace std;
struct cutie
{
	int x,y,z;
};
cutie a[35000];
short int l[3500];
int p,n,t,i,j,k,maxxx;
short int  maxx;
int comp (cutie i,cutie j)
{
	return i.x<j.x;
}


int main ()
{
	freopen ("cutii.in","r",stdin);
	freopen ("cutii.out","w",stdout);
	scanf("%d%d",&n,&t);
	for (i=1;i<=t;i++)
	{
		maxx=0;
		l[1]=1;
		for (j=1;j<=n;j++)
			scanf("%d %d %d",&a[j].x,&a[j].y,&a[j].z);
	sort(a+1,a+n+1,comp);
	for (j=2;j<=n;j++)
	{
		p=1;
		for (k=1;k<=j;k++)
			if (a[k].x<a[j].x && a[k].y<a[j].y && a[k].z<a[j].z)
				{
					p++;
					l[k]=p;
			}
			else {
				l[k]=1;
				p=1;
			}
	}
	for (k=1;k<=n;k++)
	{
		if (l[k]>maxx)
			maxx=l[k];
		l[k]=0;
	}
		printf("%d\n",maxx);
	}
	return 0;
}