#include<fstream>
#include<algorithm>
#define MAXN 3501
#include<cstring>
using namespace std;
int aib[MAXN][MAXN],n,sol,nrc,t;
char modif[MAXN][MAXN];
struct cutie
{
    int x,y,z;
}v[MAXN];
ifstream fin("cutii.in");
ofstream fout("cutii.out");

int query(int lin,int col)
{
    int sol=0;
    for(int i=lin-1;i>0;i-=i&(-i))
    {
        for(int j=col-1;j>0;j-=j&(-j))
        {
            if(modif[i][j]==t)
            {
                sol=max(aib[i][j],sol);
            }
        }
    }
    return sol;
}

void update(int lin,int col)
{
    for(int i=lin;i<=n;i+=i&(-i))
    {
        for(int j=col;j<=n;j+=j&(-j))
        {
            if(modif[i][j]==t)
            aib[i][j]=max(aib[i][j],nrc);
            else
            {
                modif[i][j]=t;
                aib[i][j]=nrc;
            }
        }
    }
}

int main()
{
    int x,y,z;
    fin>>n>>t;
    for(;t>0;t--)
    {
        sol=0;
        for(int i=1;i<=n;i++)
        {
            fin>>x>>y>>z;
            v[x].x=x; v[x].y=y; v[x].z=z;
        }
        for(int i=1;i<=n;i++)
        {
            nrc=query(v[i].y,v[i].z)+1;
            sol=max(sol,nrc);
            update(v[i].y,v[i].z);
        }
        fout<<sol<<"\n";
    }
    return 0;
}