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

int i,j,n,m,a[3501],b[3501],t,max1,rez,x,y,z,l[3501];
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",&x,&y,&z),a[x]=y,b[x]=z;
	l[1]=1;
	rez=0;
	for(i=2;i<=n;++i)
	{
		max1=0;
		for(j=i-1;j>=1;--j)
			if(a[j]<a[i]&&b[j]<b[i]&&max1<l[j]+1)
				max1=l[j]+1;
			l[i]=max1;
			if(l[i]>rez)
				rez=l[i];
	}
	printf("%d\n",rez);
	}
    return 0;
}