#include <fstream>
#include <algorithm>

using namespace std;
int n,t;
int din[3505];
struct cut {
       int x, y, z ;
} a[3505];

ofstream g("cutii.out");

bool operator < ( const cut &a, const cut &b ) {    return a.x < b.y ;}

int main()
{
    ifstream f("cutii.in");
    f>>n>>t;
    for (int k=1; k<=t; k++)
    {
    for (int i=1; i<=n; ++i)
        f>>a[i].x>>a[i].y>>a[i].z;
    sort(a+1,a+n+1);
    int sol=1;
    for (int i=1; i<=n; i++)
    {
        din[i]=1;
        for (int j=i-1;j; --j)
        {
            if (a[j].y<a[i].y&&a[j].z<a[i].z&&din[i]<=din[j])
                din[i]=din[j]+1;
        }
        if (sol<din[i])
            sol=din[i];
    }
    g<<sol<<"\n";
    }
return 0;

}