#include <fstream>
#include <algorithm>
#include <vector>
#include <cstring>
#define nmax 3500
using namespace std;
ifstream fin("cutii.in");
ofstream fout("cutii.out");


int aib[nmax + 5][nmax + 5];

struct box{
int x;
int y;
int z;
}v[nmax + 5];

int n;


int query(int y,int z)
{
    int s=0;
    for(int i=y;i>0;i-=(i&(-i)))
        for(int j=z;j>0;j-=(j&(-j)))
            s=max(aib[i][j],s);
    return s;
}
void update(int y,int z,int val)
{
    for(int i=y;i<=n;i+=(i&(-i)))
        for(int j=z;j<=n;j+=(j&(-j)))
            aib[i][j]=max(aib[i][j],val);
}

void solve()
{
    int sol=0;
    for(int i=1;i<=n;i++)
        fin>>v[i].x>>v[i].y>>v[i].z;
    sort(v+1,v+n+1,[](box a,box b){return a.x<b.x;});
    for(int i=1;i<=n;i++)
    {
        int rez = query(v[i].y,v[i].z) + 1;
        update(v[i].y,v[i].z,rez);
        sol=max(sol,rez);
    }
    fout<<sol<<'\n';
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            aib[i][j]=0;
}

int main()
{
    int t;
    fin>>n>>t;
    for(int i=1;i<=t;i++)
        solve();
}