#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("cutii.in");
ofstream g("cutii.out");
int d[3501],n,T,aib[3501],Max;
#define zeros(x)((x^(x-1))&x)
struct cutie
{
    int x,y,z,ind;
}c[3501];
bool cmp1(cutie a,cutie b)
{
    return (a.x<b.x);
}
bool cmp2(cutie a,cutie b)
{
    if((a.y==b.y)&&(a.z<=b.z)||(a.y<=b.y)&&(a.z==b.z))
    return (a.ind>b.ind);
    else return((a.y<b.y)&&(a.z<b.z));
}
void update(int x,int val)
{
    d[x]+=val;
    for(int i=x; i<=n; i+=zeros(i))
    if(d[x]>aib[i])
        aib[i]=d[x];

}
int calcul(int x)
{
  int M=0;
    for(int i=x; i>0; i-=zeros(i))
        if(M<aib[i])
            M=aib[i];
    return M;
}

int main()
{
   f>>n>>T;
   for(int l=1;l<=T;l++)
   {   Max=0;
       for(int i=1;i<=n;i++)
        f>>c[i].x>>c[i].y>>c[i].z;
       sort(c+1,c+n+1,cmp1);
       for(int i=1;i<=n;i++)
        {c[i].ind=i;
         d[i]=0;
         aib[i]=0;
        }
       sort(c+1,c+n+1,cmp2);
       for(int k=1; k<=n; k++)
        {
                int M=calcul(c[k].ind-1);
                update(c[k].ind,M+1);
                Max=max(M+1,Max);
        }
        g<<Max<<' '<<'\n';

   }

    return 0;
}