#include<fstream>
 #include<algorithm>
 using namespace std;
 
 int i,j,n,m,l[3501],t,max1,rez;
 struct dim
 {
	int x,y,z;
 };
 dim a[3501];
 bool cmp(dim a,dim b)
 {
	return a.x<b.x;
 }
 int main()
 {
	freopen("cutii.in","r",stdin);
	freopen("cutii.out","w",stdout);
	scanf("%d%d",&n,&t);
	while(t--)
	{
		for(i=1;i<=n;++i)
			scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].z);
		l[n]=1;
		max1=0,rez=0;
		sort(a+1,a+n+1,cmp);
		for(i=n-1;i>=1;--i)
		{
			max1=1;
			for(j=i+1;j<=n;++j)
				if(a[i].x<a[j].x&&a[i].y<a[j].y&&a[i].z<a[j].z&&max1<l[j]+1)
					max1=l[j]+1;
				l[i]=max1;
				if(rez<max1)
					rez=max1;
		}
		printf("%d\n",rez);
	}
	return 0;
 }