#include <iostream>
#include <fstream>
#include <algorithm>
#include <stack>

using namespace std;

ifstream fin("cutii.in");
ofstream fout("cutii.out");

const int N = 3500;

struct pp{
	int x, y, z;
}v[N + 1];

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

struct AIB2d{
	int aib[N + 1][N + 1], n;

	AIB2d(){
		for(int i = 0; i <= N; i++)
			for(int j = 0; j <= N; j++)
				aib[i][j] = 0;
	}

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

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

	int query(int iQ, int jQ){
		int ans = 0;
		for(int i = iQ; i >= 1; i -= lsb(i))
			for(int j = jQ; j >= 1; j -= lsb(i))
				ans = max(ans, aib[i][j]);
		return ans;
	}

	void clear(int iU, int jU){
		for(int i = 1; i <= iU; i += lsb(i))
			for(int j = 1; j <= jU; j += lsb(j))
				aib[i][j] = 0;
	}
}myAib;

void solve(int n){
	myAib.n = n;

	for(int i = 1; i <= n; i++)
		fin >> v[i].x >> v[i].y >> v[i].z;

	sort(v + 1, v + n + 1, cmp);

	int ans = 0;
	for(int i = 1; i <= n; i++){
		int tmp = myAib.query(v[i].y - 1, v[i].z - 1) + 1;
		myAib.update(v[i].y, v[i].z, tmp);
		ans = max(ans, tmp);
	}

	fout << ans << '\n';

	for(int i = 1; i <= n; i++)
		myAib.clear(v[i].y, v[i].z);
}

int main(){
	int n, T;
	fin >> n >> T;

	while(T--)
		solve(n);
	
	return 0;
}