#include<fstream>
#include<algorithm>
#include<cstring>
#include<vector>
#include<string>
#include<queue>
#define abs(x) ((x>0)?(x):(-(x)))
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define ll long long
using namespace std;
ifstream in("cutii.in");
ofstream out("cutii.out");
const int Nmax = 3505;
int v[Nmax],X[Nmax],Y[Nmax];
int A[Nmax][Nmax];
int N,T,Ans;
int lsb(int& x){
    return (x&(-x));
}
int Query(int x,int y){
    int R=0,i=x;
    while(i){
        int j=y;
        while(j){
            R=max(R,A[i][j]);
            j-=lsb(j);
        }
        i-=lsb(i);
    }
    return R;
}
void Update(int x,int y,int val){
    int i=x;
    while(i<=N){
        int j=y;
        while(j<=N){
            A[i][j]=max(A[i][j],val);
            j+=lsb(j);
        }
        i+=lsb(i);
    }
}
void Reset(int x,int y){
    int i=x;
    while(i<=N){
        int j=y;
        while(j<=N){
            A[i][j]=0;
            j+=lsb(j);
        }
        i+=lsb(i);
    }
}
int main(){
    in>>N>>T;
    for(;T;--T){
        int x,y,z;
        for(int i=1;i<=N;i++){
            in>>x>>y>>z;
            v[z]=i,X[i]=x,Y[i]=y;
        }
        Ans=0;
        for(int i=1;i<=N;i++){
            int cur=Query(X[v[i]],Y[v[i]]);
            Update(X[v[i]],Y[v[i]],cur+1);
            Ans=max(Ans,cur+1);
        }
        out<<Ans<<'\n';
        for(int i=1;i<=N;i++){
            Reset(X[v[i]],Y[v[i]]);
        }
    }
    return 0;
}