#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;
struct Item {
    int x,y,z;
} v[Nmax],Block[Nmax];
int A[Nmax][Nmax],Cur[Nmax];
int N,T,Ans,K;
bool cmp(Item a,Item b){
    if(a.z==b.z) if(a.y==b.y) return a.x<b.x;
    if(a.z==b.z) return a.y<b.y;
    return a.z<b.z;
}
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);
    }
}
int main(){
    in>>N>>T;
    for(;T;--T){
        memset(A,0,sizeof(A));
        for(int i=1;i<=N;i++){
            in>>v[i].x>>v[i].y>>v[i].z;
        }
        sort(v+1,v+N+1,cmp);
        Ans=0;
        K=0,Block[++K]=v[1];
        for(int i=2;i<=N;i++){
            if(v[i].z==Block[1].z) Block[++K]=v[i];
            else{
                for(int j=1;j<=K;j++){
                    Cur[j]=Query(Block[j].x-1,Block[j].y-1);
                }
                for(int j=1;j<=K;j++){
                    Update(Block[j].x,Block[j].y,Cur[j]+1);
                    Ans=max(Ans,Cur[j]+1);
                }
                K=0,Block[++K]=v[i];
            }
        }
        for(int j=1;j<=K;j++){
            Cur[j]=Query(Block[j].x-1,Block[j].y-1);
        }
        for(int j=1;j<=K;j++){
            Update(Block[j].x,Block[j].y,Cur[j]+1);
            Ans=max(Ans,Cur[j]+1);
        }
        out<<Ans<<'\n';
    }
    return 0;
}