#include <iostream>
#include <fstream>
#include <algorithm>
#define dim 3501
using namespace std;
ifstream fin("cutii.in");
ofstream fout("cutii.out");
struct cutie
{
    int x,y,z;
}c[dim];
int cmf(int a,int b)
{
    if(c[a].x==c[b].x)
    {
        if(c[a].y==c[b].y)
        return (c[a].z<c[b].z);
        else
        return (c[a].y<c[b].y);
    }
    else
    return (c[a].x<c[b].x);

}
int N,T;
int IND[dim];
int main()
{
    fin>>N>>T;
    int i,j;
    for(i=1;i<=T;i++)
    {
        for(j=1;j<=N;j++)
        {fin>>c[j].x>>c[j].y>>c[j].z;
         IND[j]=j;}
        sort(IND+1,IND+N+1,cmf);
        int k=1,maxc=1,aux=1;
        while(k<N)
                if(c[IND[aux]].x<c[IND[k+1]].x&&c[IND[aux]].y<c[IND[k+1]].y&&c[IND[aux]].z<c[IND[k+1]].z)
            {
                aux=k+1;
                maxc++;
                k++;
            }
            else
            k++;
          fout<<maxc<<"\n";
    }
    return 0;
}