#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;

struct cutie{int x,y,z;}v[4000];
int n,i,j,k,T,max1,t,L[4000];

int cmp(cutie a,cutie 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;

}


int main(){

freopen("cutii.in","r",stdin);
freopen("cutii.out","w",stdout);

scanf("%d %d",&n,&T);

for(t=1;t<=T;t++){
for(i=1;i<=n;i++)
        {scanf("%d %d %d",&v[i].x,&v[i].y,&v[i].z);
        L[i]=1;}

sort(v+1,v+1+n,cmp);
max1=1;
for(i=2;i<=n;i++)
        for(j=1;j<i;j++)
                {if(v[i].x>v[j].x)
                if(v[i].y>v[j].y)
                if(v[i].z>v[j].z)
                if(L[i]<(L[j]+1))
                        {L[i]=L[j]+1;
                        if(L[i]>max1)max1=L[i];} }
printf("%d\n",max1);
}


return 0;}