#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("cutii.in");
ofstream g("cutii.out");
struct punct
{
    long x,y,z;
};
long i,j,n,max1;
long t,l;
long v[3505];
punct A[3505];
inline int comp(punct a,punct b)
{
	if(a.x<b.x)
		return 1;
	return 0;
}
int main()
{
	f>>n>>t;
	for(i=1;i<=t;++i)
	{
		for(j=1;j<=n;++j)
			f>>A[j].x>>A[j].y>>A[j].z;
		sort(A+1,A+n+1,comp);
		for(j=1;j<=n;++j)
			v[j]=1;
		for(j=1;j<=n;++j)
			for(l=j+1;l<=n;++l)
				if(A[j].y<A[l].y&&A[j].z<A[l].z&&v[j]+1>v[l])
					v[l]=v[j]+1;
		max1=0;
		for(j=1;j<=n;++j)
			if(v[j]>max1)
				max1=v[j];
		g<<max1<<"\n";
	}
	return 0;
}