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

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

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

cutie v[3505];
int dp[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;
			dp[i]=0;
		}
		sort (v+1, v+n+1, comp);
		
		for (i=1; i<=n; i++) {
			for (j=i-1; j; j--) if (v[j].x<v[i].x && v[j].y<v[i].y && v[j].z<v[i].z && dp[j]>=dp[i]) dp[i]=dp[j]+1;
			if (dp[i]>mx) mx=dp[i];
		}
		g<<mx+1<<"\n";
	}
}