#include<fstream>
#include<cstring>
#include<algorithm>
#define N 3600
using namespace std;
ifstream f("cutii.in");
ofstream g("cutii.out");
struct el{int x,y,z;} v[N];
int i,n,T,sol,a[5],A[N][N],be,cs;
void upd(int X,int Y)
{
	for(;X<=n;X+=X&-X)
		for(int YU=Y;YU<=n;YU+=YU&-YU)
			A[X][YU]=max(A[X][YU],cs);
}
int find(int X,int Y)
{
	int sol=0;
	for(;X;X-=X&-X)
		for(;Y;Y-=Y&-Y)
			sol=max(sol,A[X][Y]);
	return sol;
}
int main ()
{
	f>>n>>T;
	while(T--)
	{
		for(i=1;i<=n;++i)
		{
			f>>a[1]>>a[2]>>a[3];
			
			sort(a+1,a+4);
			v[a[1]].x=a[1]; v[a[1]].y=a[2]; v[a[1]].z=a[3];
		}
		sol=0;
		for(i=1;i<=n;++i)
			memset(A[i],0,sizeof(A[i]));
		for(i=1;i<=n;++i)
		{
			cs=find(v[i].y-1,v[i].z-1)+1;
			if(cs>sol)
				sol=cs;
			upd(v[i].y,v[i].z);
		}
		g<<sol<<"\n";
	}
	return 0;
}