#include <cstdio>
#include <algorithm>
#define Nmax 3505

using namespace std;

int N,dp[Nmax],aib[Nmax][Nmax];

struct cell
{
    int x,y,z;
    bool operator < (const cell A) const
    {
        return x<A.x;
    }
};
cell a[Nmax];

inline void Update(int x, int y, int val)
{
    int i,j;
    for(i=x;i<=N;i+=(i&(-i)))
        for(j=y;j<=N;j+=(j&(-j)))
            aib[i][j]=max(aib[i][j],val);
}

inline void Update0(int x, int y)
{
    int i,j;
    for(i=x;i<=N;i+=(i&(-i)))
        for(j=y;j<=N;j+=(j&(-j)))
            aib[i][j]=0;
}

inline int Query(int x, int y)
{
    int i,j,sol=0;
    for(i=x;i>0;i-=(i&(-i)))
        for(j=y;j>0;j-=(j&(-j)))
            sol=max(sol,aib[i][j]);
    return sol;
}

int main()
{
    int T,i,sol;
    freopen ("cutii.in","r",stdin);
    freopen ("cutii.out","w",stdout);
    scanf("%d%d", &N,&T);
    while(T--)
    {
        sol=0;
        for(i=1;i<=N;++i)
            scanf("%d%d%d", &a[i].x,&a[i].y,&a[i].z);
        sort(a+1,a+N+1);
        for(i=1;i<=N;++i)
        {
            dp[i]=1+Query(a[i].y-1,a[i].z-1);
            sol=max(sol,dp[i]);
            Update(a[i].y,a[i].z,dp[i]);
        }
        printf("%d\n", sol);
        for(i=1;i<=N;++i)
            Update0(a[i].x,a[i].y);
    }
    return 0;
}