#include <bits/stdc++.h>

using namespace std;

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

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

bool cmp(cut a, cut 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;
}

cut C[3510];
int A[3510],n,sol,t;

int main(){
	fin>>n>>t;
	while(t--){
		sol=0;
		for(int i=0;i<n;i++){
			fin>>C[i].x>>C[i].y>>C[i].z;
			A[i]=1;
		}
		sort(C,C+n,cmp);
		for(int i=0;i<n;i++){
			for(int j=0;j<n;j++){
				if(C[j].x>=C[i].x && C[j].y>=C[i].y && C[j].z>=C[i].z){
					A[i]=max(A[i],A[j]+1);
					sol=max(A[i],sol);
				}
			}
		}
		fout<<sol<<'\n';
	}
}