#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstring>
using namespace std;
vector<pair<int,pair<int,int> > >V;
int t,n,i,x,y,z,AIB[4010][4010],query(int,int),SOL,maxim;
void update(int,int,int),initializeaza();
int main()
{
    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",&x,&y,&z);
            V.push_back(make_pair(x,make_pair(y,z)));
        }
        sort(V.begin(),V.end());
        initializeaza();
        SOL=0;
        vector<pair<int,pair<int,int> > >::iterator it=V.begin();
        for(i=1;i<=n;i++)
        {
            y=(*it).second.first;
            z=(*it).second.second;
            maxim=query(y,z)+1;
            update(maxim,y,z);
            SOL=max(SOL,maxim);
            ++it;
        }
        printf("%d\n",SOL);
    }
}
int query(int y,int z)
{
    int ret=0;
    for(int X=y;X>=1;X-=X&(-X))
        for(int Y=z;Y>=1;Y-=Y&(-Y))
            ret=max(ret,AIB[X][Y]);
    return ret;
}
void update(int M,int y,int z)
{
    for(int X=y;X<=n;X+=X&(-X))
        for(int Y=z;Y<=n;Y+=Y&(-Y))
            AIB[X][Y]=max(AIB[X][Y],M);
}
void initializeaza()
{
    for(int X=1;X<=n;X+=X&(-X))
        for(int Y=1;Y<=n;Y+=Y&(-Y))
            AIB[X][Y]=0;
}