# include <fstream>
# include <cstdio>
# include <algorithm>
  using namespace std;
  
    struct stu { 
		int x, y, z;
	};
	
    bool cmp (stu a, stu b){
		if (a.x==b.x){
			if (a.y==b.y){
				return a.z<b.z;
			}
			return a.y<b.y;
		}
		return a.x<b.x;
    }
	
	stu v[3510];
	int n, i, j, mx, a[3510], t;
	
	int main (){
		ifstream f ("cutii.in");
		f>>n>>t;
		ofstream g ("cutii.out");
		for (; t; --t){
    		for (i=1; i<=n; ++i) f>>v[i].x>>v[i].y>>v[i].z;
	    	sort (v+1, v+n+1, cmp);
    		//for (i=1; i<=n; ++i, g<<'\n') 
	    	//	g<<v[i].x<<' '<<v[i].y<<' '<<v[i].z;
    		mx=1;
	    	a[n]=1;
		    for (i=n-1; i; --i)
			    for (j=i+1; j<=n; ++j){
				    if (v[j].x>v[i].x && v[j].y>v[i].y && v[j].z>v[i].z){
					    a[i]=a[j]+1;
				    	mx=max (mx, a[i]);
    				}
	    		}
			g<<mx<<'\n';
		}
    	g.close ();
	    return 0;
	}