#include<cstdio>
#include<algorithm>
#define lsb(x) ((x)&(-x))
using namespace std;
struct box
{
	int x,y,z;
	inline bool operator<(const box &other) const
	{
		return z<other.z;
	}
} a[3505];
int n,aib[3505][3505];
int d[3505];
void update(int x,int y,int val)
{
	for(int i=x;i<=n;i+=lsb(i))
		for(int j=y;j<=n;j+=lsb(j))
			aib[i][j]=max(aib[i][j],val);
}
void turn_zero(int x,int y)
{
	for(int i=x;i<=n;i+=lsb(i))
		for(int j=y;j<=n;j+=lsb(j))
			aib[i][j]=0;
}
int query(int x,int y)
{
	int ans=0;
	for(int i=x;i;i-=lsb(i))
		for(int j=y;j;j-=lsb(j))
			ans=max(ans,aib[i][j]);
	return ans;
}
int main()
{
	freopen("cutii.in","r",stdin);
	freopen("cutii.out","w",stdout);
	int T,ans;
	for(scanf("%d%d",&n,&T);T;T--)
	{
		for(int i=1;i<=n;i++)
			scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].x);
		sort(a+1,a+n+1);
		ans=0;
		for(int i=1;i<=n;i++)
		{
			d[i]=query(a[i].x-1,a[i].y-1)+1;
			update(a[i].x,a[i].y,d[i]);
			ans=max(ans,d[i]);
		}
		printf("%d\n",ans);
		for(int i=1;i<=n;i++)
			turn_zero(a[i].x,a[i].y);
	}
	return 0;
}