#include <cstdio>
#include <algorithm>
FILE*f=fopen("cutii.in","r");
FILE*g=fopen("cutii.out","w");
using namespace std;
int i,T,n;
int AIB[3505][3505];
struct point
{
    int x,y,z;
}v[3505];
inline void read()
{
    for (register int i=1;i<=n;i++)
        fscanf(f,"%d %d %d",&v[i].x,&v[i].y,&v[i].z);
}
inline bool cmp(point a,point b)
{
    return a.x<b.x;
}
inline void update(int x,int y,int val)
{
    for (;x<=n;x+=x&-x)
        for (register int j=y;j<=n;j+=j&-j)
            if (val) AIB[x][j]=max(AIB[x][j],val);
            else AIB[x][j]=val;
}
inline int query(int x,int y)
{
    int res=0;
    for (;x;x-=x&-x)
        for (register int j=y;j;j-=j&-j)
             res=max(res,AIB[x][j]);
    return res;
}
int main()
{
    fscanf(f,"%d %d",&n,&T);
    while (T--)
    {
        read(); int res=0;
        sort(v+1,v+n+1,cmp);
        for (i=1;i<=n;i++)
        {
            int foo=query(v[i].y-1,v[i].z-1)+1;
            res=max(res,foo);
            update(v[i].y,v[i].z,foo);
        }
        for (i=1;i<=n;i++) update(v[i].y,v[i].z,0);
        fprintf(g,"%d\n",res);
    }
    return 0;
}