#include <fstream>
#include <algorithm>
#define In "cutii.in"
#define Out "cutii.out"
#define Nmax 3502
#define f(x) F[x]
#define PSS pair<short ,pair<short ,short > >

using namespace std;

PSS A[Nmax];
short N,F[Nmax], cnt,mat[Nmax][Nmax];
ifstream in(In);
ofstream out(Out);

class AIB2D
{
    public:
    inline void Update(const int x,const int y,const short value,bool op)
    {
        int i,j;
        for(i = x;i <= N;i += f(x))
            for(j = y;j <= N;j += f(y))
                if(mat[i][j]==cnt)
                    aib[i][j] = max(aib[i][j],value);
                else
                {
                    mat[i][j] = cnt;
                    aib[i][j] = value;
                }
    }
    inline int Query(const int x,const int y)
    {
        short i, j, value = 0;
        for(i = x; i; i -= f(i))
            for(j = y; j;j -= f(j))
                if(mat[i][j]==cnt)
                    value = max(aib[i][j],value);
        return value;
    }
    private: short aib[Nmax][Nmax];
};
AIB2D AIB;

inline void Read()
{
    for(int i=1;i<=N;++i)
        in>>A[i].first>>A[i].second.first>>A[i].second.second;
}

inline int Solve()
{
    int i,best = 0, x;
    sort(A+1,A+N+1);
    cnt ++;
    for(i = 1;i <= N; ++i)
    {
        x = 1+AIB.Query(A[i].second.first,A[i].second.second);
        AIB.Update(A[i].second.first,A[i].second.second,x,1);
        best = max(best,x);
    }
    return best;
}

inline void Calculate()
{
    int i;
    for(i=1;i<=N;++i)
        F[i] = (i& -i);
}

int main()
{
    int T;
    in>> N >> T;
    for(Calculate(); T ;--T)
    {
        Read();
        out<<Solve()<<"\n";
    }
    in.close();
    out.close();
    return 0;
}