#include<cstdio>
#include<algorithm>
using namespace std;
pair <int,int> v[3505];
int t,n,x,y,z,sol,A[3505][3505];
void update(int p, int q, int x)
{
    int i,j;
    for (i=p;i<=n;i+=(i&(-i)))
        for (j=q;j<=n;j+=(j&(-j)))
            A[i][j]=max(A[i][j],x);
}
int query(int p, int q)
{
    int i,j,Max=0;
    for (i=p;i>0;i-=(i&(-i)))
        for (j=q;j>0;j-=(j&(-j)))
            Max=max(Max,A[i][j]);
    return Max;
}
int main()
{
    int i,j,k,l,Max;
    freopen("cutii.in","r",stdin);
    freopen("cutii.out","w",stdout);
    scanf("%d%d",&n,&t);
    for (k=0;k<t;++k)
    {

        sol=0;
        for (i=1;i<=n;++i)
        {
            scanf("%d%d%d",&x,&y,&z);
            v[z]=make_pair(x,y);
        }
        for (i=1;i<=n;++i)
        {
            Max=query(v[i].first-1,v[i].second-1);
            update(v[i].first,v[i].second,Max+1);
            sol=max(sol,Max+1);
        }
        printf("%d\n",sol);

        for (l=1;l<=n;++l)
            for (i=v[l].first;i<=n;i+=(i&-i))
                for (j=v[l].second;j<=n;j+=(j&-j))
                    A[i][j]=0;


    }
    return 0;
}