#include<cstdio>
#include<algorithm>
using namespace std;
struct cutie
{
    int x,y,z;
    bool operator <(const cutie &aux) const
    {
        return x<aux.x;
    }
}v[3507];
int aib2d[3507][3507],d[3507],n,t;
void update(int x,int y,int s)
{
    for(int i=x;i<=n;i+=i&(-i))
    for(int j=y;j<=n;j+=j&(-j))
        aib2d[i][j]=max(aib2d[i][j],s);
}
int query(int x,int y)
{
    int s=0;
    for(int i=x;i>=1;i-=i&(-i))
        for(int j=y;j>=1;j-=j&(-j))
        s=max(s,aib2d[i][j]);
        return s;
}
void clr(int x,int y)
{
    for(int i=x;i<=n;i+=i&(-i))
        for(int j=y;j<=n;j+=j&(-j))
            aib2d[i][j]=0;
}
int main()
{
    freopen("cutii.in", "r", stdin);
    freopen("cutii.out", "w", stdout);
    scanf("%d%d",&n,&t);
    for(;t;t--)
    {
        int sol=0;
        for(int i=1;i<=n;i++) scanf("%d%d%d",&v[i].x,&v[i].y,&v[i].z);
        sort(v+1,v+1+n);
        for(int i=1;i<=n;i++)
        {
            int s=query(v[i].y-1,v[i].z-1);
            d[i]=s+1;
            update(v[i].y,v[i].z,d[i]);
        }
        for(int i=1;i<=n;i++)
            sol=max(sol,d[i]);
        printf("%d\n",sol);
        for(int i=1;i<=n;i++)
            clr(v[i].y,v[i].z);
    }
    return 0;

}