#include <fstream>
#include <cstring>
#include <algorithm>
#define DIM 3502
using namespace std;

ifstream fin("cutii.in");
ofstream fout("cutii.out");
int N,T,L[DIM],solmax;
struct cutie{
    int first;
    int second;
    int third;
};
cutie v[DIM];
int cmp(cutie a,cutie b){
    return a.first<b.first;
}
int main(){
    fin>>N>>T;
    while(T--){
        for(int i=1;i<=N;i++)
            fin>>v[i].first>>v[i].second>>v[i].third;
        sort(v+1,v+N+1,cmp);
        memset(L,0,sizeof(L));
        solmax=0;
        for(int i=1;i<=N;i++){
            int maxim=0;
            for(int j=1;j<i;j++)
                if(v[i].second>v[j].second && v[i].third>v[j].third && L[j]>maxim)
                    maxim=L[j];
            L[i]=maxim+1;
            solmax=max(solmax,L[i]);
        }
        fout<<solmax<<"\n";
    }
    fin.close();fout.close();
    return 0;
}