#include <fstream>
#include <algorithm>
using namespace std;

ifstream f("cutii.in"); ofstream g("cutii.out");

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

cutie v[3505], aux[3505];
int i, j, n, t, mx, y, z;

inline bool comp (cutie fx, cutie fy){ return fx.x<fy.x;}

int main(){
	f>>n>>t;
	
	for (int ii=1; ii<=t; ii++){
		mx=0;
		for (i=1; i<=n; i++) f>>v[i].x>>v[i].y>>v[i].z;
		sort (v+1, v+n+1, comp);
		
		for (i=1; i<=n; i++) {
			j=1;
			y=v[i].y; z=v[i].z;
			while (y>aux[j].y && z > aux[j].z && j<=mx) j++;
			
			if (j>mx) mx=j;
			aux[j].y=y; aux[j].z=z;
		}
		g<<mx<<"\n";
		for (i=1; i<=mx; i++) { aux[i].y=0; aux[i].z=0; }
	}
}