#include <fstream>
#include <algorithm>
#include <vector>
#define nmax 3505

using namespace std;

int n, T;
int a[nmax][nmax];
int r, val;

struct cutie{

    int x, y, z;

}v[nmax];

struct cmp{
    inline bool operator () ( const cutie &a , const cutie &b ){
        return a.x < b.x;
    }
};


ifstream f("cutii.in");
ofstream g("cutii.out");

int bit(int x ){

    return x & -x;

}
/*
void citeste(){

    f>>n>>T;

}
*/
int maxim(int x, int y){

    if ( x > y ) return x;
    return y;

}

void udpate(int x, int y, int val){

    for(int i=x; i<=n; i+=bit(i))
        for(int j=y; j<=n; j+=bit(j))
            if (a[i][j] < val) a[i][j] = val;
            //a[i][j] = maxim(a[i][j], val);

}

void udpate_2(int x, int y){

    for(int i=x; i<=n; i+=bit(i))
        for(int j=y; j<=n; j+=bit(i))
            a[i][j] = 0;

}

int query(int x, int y){

    int sol = 0;

    for(int i=x; i; i-=bit(i))
        for(int j=y; j; j-=bit(j))
            if (a[i][j] > sol) sol = a[i][j];
            //sol = maxim(sol, a[i][j]);

    return sol;

}

void rezolva(){

    f>>n>>T;

    for(; T; --T){
        r = 0;
        for(int i=1; i<=n; ++i){
            f>>v[i].x>>v[i].y>>v[i].z;
        }

        sort(v+1, v+n+1, cmp());

        for(int i=1; i<=n; ++i){
            val = query(v[i].y-1, v[i].z-1) + 1;
            if ( val > r ) r = val;
            udpate(v[i].y, v[i].z, val);
        }

        for(int i=1; i<=n; ++i)
            udpate_2(v[i].y, v[i].z);

        g<<r<<"\n";
    }

}


int main(){

  //citeste();
    rezolva();

    f.close();
    g.close();

    return 0;

}