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

#define maxim(a,b) (a>b ? a : b)

struct box
{
    int x,y,z;
};
box q[4003];
int n,t;
short int AIB[3505][3503];

void clear(int px,int py)
{
    int sy=py;
    for(;px<=n;px+=px^(px-1)&px)
        for(py=sy;py<=n;py+=py^(py-1)&py)
            AIB[px][py]=0;
}

void update(int px,int py,int val)
{
    int sy=py;
    for(;px<=n;px+=px^(px-1)&px)
        for(py=sy;py<=n;py+=py^(py-1)&py)
            AIB[px][py]=maxim(AIB[px][py],val);
}

int query(int px,int py)
{
    int sy=py,sol=0;
    for(;px;px-=px^(px-1)&px)
        for(py=sy;py;py-=py^(py-1)&py)
            sol=maxim(sol,AIB[px][py]);
    return sol;
}

int cmp(const box& a,const box& b)
{
    return (a.x<b.x);
}

int main ()
{
    int i,j,sol=0;
    freopen("cutii.in","r",stdin);
    freopen("cutii.out","w",stdout);
    scanf("%d%d",&n,&t);
    for(;t;t--)
    {
        for(i=1;i<=n;i++)
            scanf("%d%d%d",&q[i].x,&q[i].y,&q[i].z);
        sort(q+1,q+n+1,cmp);
        sol=0;
        for(i=1;i<=n;i++)
        {
            j=query(q[i].y-1,q[i].z-1)+1;
            update(q[i].y,q[i].z,j);
            sol=maxim(sol,j);
        }
        printf("%d\n",sol);
        for(i=1;i<=n;i++)
            clear(q[i].y,q[i].z);
    }
    return 0;
}