#include<stdio.h>
#include<algorithm>

#define maxn 3505

using namespace std;

FILE*f=fopen("cutii.in","r");
FILE*g=fopen("cutii.out","w");

int n,t,i,j,best,crt;
int aib[maxn][maxn];

struct cutie{
	int x,y,z;
}A[maxn];

struct cmp{
	inline bool operator () ( const cutie &a , const cutie &b ){
		return a.x < b.x;
	}
};

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

inline void update_aib2D ( int x , int y , int val ){

	for ( int i = x ; i <= n ; i += lsb(i) ){
		for ( int j = y ; j <= n ; j += lsb(j) ){
			if ( val > aib[i][j] )
				aib[i][j] = val;
		}
	}
}

inline int query_aib2D ( int x , int y ){
	int bst = 0;

	for ( int i = x ; i > 0 ; i -= lsb(i) ){
		for ( int j = y ; j > 0 ; j -= lsb(j) ){
			if ( aib[i][j] > bst )
				bst = aib[i][j];
		}
	}

	return bst;
}

inline void set0_aib2D ( 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 solve () {

	for ( i = 1 ; i <= n ; ++i ){
		fscanf(f,"%d %d %d",&A[i].x,&A[i].y,&A[i].z);
	}
	sort(A+1,A+n+1,cmp());

	best = 0;
	for ( i = 1 ; i <= n ; ++i ){
		crt = query_aib2D(A[i].y-1,A[i].z-1) + 1;
		if ( crt > best )	best = crt;
		update_aib2D(A[i].y,A[i].z,crt);
	}

	for ( i = 1 ; i <= n ; ++i ){
		set0_aib2D(A[i].y,A[i].z);
	}

	return best;
}

int main () {

	fscanf(f,"%d %d",&n,&t);
	for ( int i = 1 ; i <= t ; ++i ){
		fprintf(g,"%d\n",solve());
	}

	fclose(f);
	fclose(g);

	return 0;
}