#include <fstream>
#include <algorithm>
#include <cstring>
#define bit(x) (x&(-x))
#define dim 3505
using namespace std;
ifstream fin("cutii.in");
ofstream fout("cutii.out");
int n,i,j,t,A[dim][dim],s,sol;
struct verm{
    int x,y,z;
}v[dim];
bool cmp(verm a, verm b){
    return a.z<b.z;
}
void update(int x, int y){
    for(int i=x;i<=n;i+=bit(i)){
        for(int j=y;j<=n;j+=bit(j)){
            A[i][j] = max(A[i][j],s+1);
        }
    }
}
void query(int x, int y){
    for(int i=x;i>=1;i-=bit(i)){
        for(int j=y;j>=1;j-=bit(j)){
            s=max(A[i][j],s);
        }
    }
}
void clean(){
    for(int i=1;i<=n;i++){
        for(int ii = v[i].x; ii <= n; ii+=bit(ii)){
            for(int j = v[i].y; j <= n; j+=bit(j)){
                A[ii][j]=0;
            }}}}
int main(){
    fin>>n>>t;
    while(t--){
        for(i=1;i<=n;i++){
            fin>>v[i].x>>v[i].y>>v[i].z;
        }
        sort(v+1,v+n+1,cmp);
        for(i=1;i<=n;i++){
            s=0;
            query(v[i].x-1, v[i].y-1);
            if(s+1>sol){
                sol=s+1;
            }
            update(v[i].x,v[i].y);
        }
        fout<<sol<<"\n";
        clean();
        sol=0;
    }
    return 0;
}