#include <cstdio>
#include <algorithm>

#define NMax 3505

using namespace std;

typedef struct
{
    int X, Y, Z;
}
Box;
int N, AIB[NMax][NMax];
Box B[NMax];

inline int Max (int a, int b)
{
    if (a>b)
    {
        return a;
    }
    return b;
}

inline bool Compare (Box a, Box b)
{
    if (a.Z<b.Z)
    {
        return true;
    }
    return false;
}

void Read ()
{
    for (int i=1; i<=N; ++i)
    {
        scanf ("%d %d %d", &B[i].X, &B[i].Y, &B[i].Z);
    }
    sort (B+1, B+N+1, Compare);
}

inline int LSB (int X)
{
    return X&(-X);
}

void Update (int X, int Y, int V)
{
    for (int i=X; i<=N; i+=LSB (i))
    {
        for (int j=Y; j<=N; j+=LSB (j))
        {
            AIB[i][j]=Max (AIB[i][j], V);
            if (V==0)
            {
                AIB[i][j]=0;
            }
        }
    }
}

int Query (int X, int Y)
{
    int Q=0;
    for (int i=X; i>0; i-=LSB (i))
    {
        for (int j=Y; j>0; j-=LSB (j))
        {
            Q=Max (Q, AIB[i][j]);
        }
    }
    return Q;
}

void LIS ()
{
    for (int i=1; i<=N; ++i)
    {
        int DP=1+Query (B[i].X-1, B[i].Y-1);
        Update (B[i].X, B[i].Y, DP);
    }
}

void ClearAIB ()
{
    for (int i=1; i<=N; ++i)
    {
        Update (B[i].X, B[i].Y, 0);
    }
}

void Print ()
{
    printf ("%d\n", Query (N, N));
}

int main()
{
    freopen ("cutii.in", "r", stdin);
    freopen ("cutii.out", "w", stdout);
    int T;
    scanf ("%d %d", &N, &T);
    for (; T>0; --T)
    {
        Read ();
        LIS ();
        Print ();
        ClearAIB ();
    }
    return 0;
}