#include <cstdio>
#include <algorithm>
#include <cstring>

using namespace std;

const int nmax=2500;

struct triple
{
	int x, y, z;
};

int n;
int aib[nmax+1][nmax+1];
triple a[nmax+1];

inline int lsb(int x)
{
	return x & -x;
}

void update(int line, int col, int val)
{
	for(int i=line; i<=n; i+=lsb(i))
		for(int j=col; j<=n; j+=lsb(j))
			aib[i][j]=max(aib[i][j], val);
}

int querry(int line, int col)
{
	int ans=-1;
	for(int i=line; i>0; i-=lsb(i))
		for(int j=col; j>0; j-=lsb(j))
			ans=max(ans, aib[i][j]);
	return ans;
}

void clear(int line, int col)
{
	for(int i=line; i<=n; i+=lsb(i))
		for(int j=col; j<=n; j+=lsb(j))
			aib[i][j]=0;
}

bool cmp(triple a, triple b)
{
	return a.x < b.x;
}

int main()
{
    freopen("cutii.in", "r", stdin);
    freopen("cutii.out", "w", stdout);
    int tests;
    scanf("%d%d", &n, &tests);
    for(int k=0;k<tests;k++)
	{
		for(int i=0;i<n;i++)
			scanf("%d%d%d", &a[i].x, &a[i].y, &a[i].z);
		sort(a, a+n, cmp);
		int ans=-1;
		for(int i=0;i<n;i++)
		{
			int dp_i=querry(a[i].y, a[i].z)+1;
			ans=max(ans, dp_i);
			update(a[i].y, a[i].z, dp_i);
		}
		printf("%d\n", ans);

		//setam aib pe 0 in log
		for(int i=0;i<n;i++)
			clear(a[i].y, a[i].z);
	}
	return 0;
}