#include<stdio.h>
#define N 3505
int n,v1[N],v2[N],v3[N],v[N];
void sort(){
	int i,max,j,x;
	for(i=0;i<n-1;++i){
		max=i;
		for(j=i+1;j<n;++j)
			if(v1[j]<v1[max])
				max=j;
		if(max!=i){
			x=v1[max];
			v1[max]=v1[i];
			v1[i]=x;
			x=v2[max];
			v2[max]=v2[i];
			v2[i]=x;
			x=v3[max];
			v3[max]=v3[i];
			v3[i]=x;
		}
	}
}
int main(){
	int t,i,j,k,max;
	freopen("cutii.in","r",stdin);
	freopen("cutii.out","w",stdout);
	scanf("%d%d",&n,&t);
	for(i=0;i<t;++i){
		for(j=0;j<n;++j)
			scanf("%d%d%d",&v1[j],&v2[j],&v3[j]);
		sort();
		v[N]=0;
		v[0]=1;
		max=0;
		for(j=0;j<n-1;++j)
			for(k=j+1;k<n;++k){
				if(v1[j]<v1[k]&&v2[j]<v2[k]&&v3[j]<v3[k])
					v[k]=v[j]+1;
				else
					v[k]=1;
				if(v[k]>max)
					max=v[k];
			}
		printf("%d\n",max);
	}
	fclose(stdin);
	fclose(stdout);
	return 0;
}