#include <bits/stdc++.h>

using namespace std;

struct cutie{
	int x,y,z;
};
vector <cutie> p;
bool incape(cutie a, cutie b){ //b in a
	return(a.x<b.x)&&(a.y<b.y)&&(a.z<b.z);
}
int main(){
	int n,t,a[3500];
	cutie c;
	ifstream fin("cutii.in");
	ofstream fout("cutii.out");
	fin>>n>>t;
	for (int i=0;i<t;i++){
		for(int j=0;j<n;j++){
			fin>>c.x>>c.y>>c.z;
			p.push_back(c);
		}
	 sort(p.begin(),p.end(),incape);
	  for (int j=1;j<n;j++)
	   for(int k=0;k<j;k++)
	    if (incape(p[k],p[j]) && a[j]<=a[k]) a[j]=a[k]+1;
	 if(!a[n-1]) a[n-1]=1;
	 fout<<a[n-1]<<'\n';
	 p.clear();
	}
	return 0;
}