#include<cstdio>
#include<algorithm>
using namespace std;

#define BM 3505

struct ct{
	int x,y,z;
};
ct c[BM];

bool cmp(ct a, ct b){
	if(a.x==b.x){
		if(b.y==a.y)return a.z<b.z;
		return a.y<b.y;
	}
	return a.x<b.x;
}

int ad[BM];

int main () {
	int t,n,i,j,mx;
	freopen("cutii.in","r",stdin);
	freopen("cutii.out","w",stdout);
	scanf("%d %d",&n,&t);
	for(;t;--t){
		for(i=1;i<=n;++i)scanf("%d %d %d",&c[i].x,&c[i].y,&c[i].z);
		sort(c+1,c+n+1,cmp);
		for(i=1;i<=n;++i)ad[i]=0;
		for(i=1;i<=n;++i){
			mx=1;
			for(j=1;j<i;++j){
				if(c[j].x<c[i].x&&c[j].y<c[i].y&&c[j].z<c[i].z&&mx<ad[j]+1)mx=ad[j]+1;
			}
			ad[i]=mx;
		}
		mx=1;
		for(i=1;i<=n;++i)if(mx<ad[i])mx=ad[i];
		printf("%d\n",mx);
	}
	return 0;
}