/*#include <fstream>
#include <algorithm>

#define NMax 3505

using namespace std;

ifstream fin ("cutii.in");
ofstream fout ("cutii.out");

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)
    {
        fin >> 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 ()
{
    fout << Query (N, N) << "\n";
}

int main()
{
    int T;
    fin >> N >> T;
    for (; T>0; --T)
    {
        Read ();
        LIS ();
        Print ();
        ClearAIB ();
    }
    fin.close ();
    fout.close ();
    return 0;
}*/


#include <cstdio>
#include <algorithm>

#define NMax 3505

using namespace std;

typedef struct
{
    int X, Y, Z;
}
Box;
int N, AI[3*NMax][3*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);
}

void UpdateY (int KX, int KY, int L, int R, int Y, int V)
{
    int Mid=(L+R)/2;
    if (R<=Y)
    {
        AI[KX][KY]=Max (AI[KX][KY], V);
        if (V==0)
        {
            AI[KX][KY]=0;
        }
        return;
    }
    if (Y<=Mid)
    {
        UpdateY (KX, 2*KY, L, Mid, Y, V);
    }
    else
    {
        UpdateY (KX, 2*KY+1, Mid+1, R, Y, V);
    }
    AI[KX][KY]=Max (AI[KX][2*KY], AI[KX][2*KY+1]);
}

void UpdateX (int K, int L, int R, int X, int Y, int V)
{
    int Mid=(L+R)/2;
    if (R<=X)
    {
        UpdateY (K, 1, 0, N, Y, V);
        return;
    }
    if (X<=Mid)
    {
        UpdateX (2*K, L, Mid, X, Y, V);
    }
    else
    {
        UpdateX (2*K+1, Mid+1, R, X, Y, V);
    }
    UpdateY (K, 1, 0, N, Y, V);
}

int QueryY (int KX, int KY, int L, int R, int Y)
{
    int Mid=(L+R)/2;
    if (R<=Y)
    {
        return AI[KX][KY];
    }
    if (Y<=Mid)
    {
        return QueryY (KX, 2*KY, L, Mid, Y);
    }
    return Max (QueryY (KX, 2*KY, L, Mid, Y), QueryY (KX, 2*KY+1, Mid+1, R, Y));
}

int QueryX (int K, int L, int R, int X, int Y)
{
    int Mid=(L+R)/2;
    if (R<=X)
    {
        return QueryY (K, 1, 0, N, Y);
    }
    if (X<=Mid)
    {
        return QueryX (2*K, L, Mid, X, Y);
    }
    return Max (QueryX (2*K, L, Mid, X, Y), QueryX (2*K+1, Mid+1, R, X, Y));
}

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

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

void Print ()
{
    printf ("%d\n", AI[1][1]);
}

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 ();
        Clear ();
    }
    return 0;
}