#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;
struct Compare
{
    inline bool operator () (const Box a, const Box b)
    {
        return a.X<b.X;
    }
};
int N, AIB[NMax][NMax], S;
Box B[NMax];

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

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);
}

inline 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;
            }
        }
    }
}

inline 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 ()
{
    S=0;
    for (int i=1; i<=N; ++i)
    {
        int DP=1+Query (B[i].Y-1, B[i].Z-1);
        Update (B[i].Y, B[i].Z, DP);
        S=Max (S, DP);
    }
}

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

void Print ()
{
    fout << S << "\n";
}

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