#include <fstream>
#include <algorithm>
#include <iostream>
using namespace std;
ifstream f("cutii.in");
ofstream g("cutii.out");
int n,Max,T,aib[3501][3501],d[3501][3501];
#define zeros(x)((x^(x-1))&x)
struct cutie
{
    int x,y,z;
} c[3501];
bool cmp1(cutie a,cutie b)
{
    return(a.x<b.x);
}
void update(int x,int y,int val)
{
    d[x][y]+=val;
    for(int i=x; i<n; i+=zeros(i))
        for(int j=y; j<n; j+=zeros(j))
            if(aib[i][j]<d[x][y])
                aib[i][j]=val;
}
void reset(int x,int y)
{
    for(int i=x; i<n; i+=zeros(i))
        for(int j=y; j<n; j+=zeros(j))
            aib[i][j]=0;
}

int calcul(int x,int y)
{
    int M=0;
    for(int i=x; i>0; i-=zeros(i))
        for(int j=y; j>0; j-=zeros(j))
            M=max(M,aib[i][j]);
    return M+1;
}

int main()
{
    f>>n>>T;
    for(int j=1; j<=T; j++)
    {
        Max=0;
        for(int i=1; i<=n; i++)
            f>>c[i].x>>c[i].y>>c[i].z;
        sort(c+1,c+n+1,cmp1);
        for(int i=1; i<=n; i++)
        {
            int M=calcul(c[i].y,c[i].z);
            //cout<<M<<' ';
            update(c[i].y,c[i].z,M);
            Max=max(Max,M);
        }
        g<<Max<<'\n';
        for(int i=1; i<=n; i++)
            reset(c[i].y,c[i].z);
    }

    return 0;
}