#include<fstream>
#include<algorithm>
using namespace std;
int t,n,i,j,maxim,l[3501];
struct cutie
{
	int l,L,h;
};
cutie a[3501];
int cmp(cutie a,cutie b)
{
	return ((a.l<b.l)||(a.l==b.l&&a.L<b.L)||(a.l==b.l&&a.L==b.L&&a.h<b.h));
}

int main()
{
	freopen("cutii.in","r",stdin);
	freopen("cutii.out","w",stdout);
	
	scanf("%d%d",&n,&t);
	while(t)
	{
		--t;
		maxim=0;
		for(i=1;i<=n;++i)
			scanf("%d%d%d",&a[i].l,&a[i].L,&a[i].h);		
		sort(a+1,a+n+1,cmp);
		
		l[n]=1;
		for(i=n-1;i>=1;--i)
		{
			l[i]=1;
			for(j=i+1;j<=n;++j)
				if(a[i].l<a[j].l&&a[i].L<a[j].L&&a[i].h<a[j].h)
					l[i]=max(l[i],l[j]+1);
				if(l[i]>maxim)
					maxim=l[i];
		}
		printf("%d\n",maxim);
	}
	return 0;
}