#include <bits/stdc++.h>

using namespace std;
ifstream fin("cutii.in");
ofstream fout("cutii.out");
int a[3502][3502];
int n,t,upd[3501];

struct cutie
{
    int x,y,z;
};
cutie b[3501];

bool cmp(cutie c,cutie d)
{
    return c.x<d.x;
}

int lsb(int pos)
{
    return pos & -pos;
}

void update(int l,int c,int val)
{   int aux;
    while(l<=n)
    { aux=c;
        while(aux<=n)
        { a[l][aux]=max(a[l][aux],val);
            aux+=lsb(aux);
        }
        l+=lsb(l);
    }
}
int query(int l,int c)
{
    int maxi=0;
    int aux;
    while(l)
    { aux=c;
        while(aux)
        { maxi=max(maxi,a[l][aux]);
            aux-=lsb(aux);
        }
        l-=lsb(l);
    }
    return maxi;
}
void rereset(int l,int c)
{   int aux;
    while(l<=n)
    { aux=c;
        while(aux<=n)
        { a[l][aux]=0;
            aux+=lsb(aux);
        }
        l+=lsb(l);
    }
}
int main()
{
    fin>>n>>t;
    int i,ct,j,q;
    while(t--)
    {
        for(i=1;i<=n;++i)
            fin>>b[i].x>>b[i].y>>b[i].z;
        sort(b+1,b+n+1,cmp);

        for(i=1;i<=n;)
        {     ct=0; j=0;
            while( i+j<=n && b[i+j].x==b[i].x )
            {  upd[++ct]=query(b[i+j].y-1,b[i+j].z-1)+1;
               ++j;
            }

            for(q=1;q<=ct;++q)
               update( b[i+q-1].y,b[i+q-1].z,upd[q]);
            i+=j;
        }
        fout<<query(n,n)<<"\n";
        for(i=1;i<=n;++i)
            rereset(b[i].y,b[i].z);
    }
    return 0;
}