#include<fstream>
#include<cstring>
#include<algorithm>
using namespace std;
ifstream f("cutii.in");
ofstream g("cutii.out");
int i,t,n,maxi,j,l[3505];
struct cutie{int x,y,z;};
cutie v[3505];
bool cmp(cutie a,cutie b)
{
    return a.x<b.x;
}
int main()
{
    f>>n>>t;
    for(;t;--t)
    {
        for(i=1;i<=n;++i)
        f>>v[i].x>>v[i].y>>v[i].z;
        sort(v+1,v+n+1,cmp);
        memset(l,0,sizeof(l));
        for(i=n;i;--i)
        {
            for(j=i+1;j<=n;++j)
            if(l[i]<l[j]+1&&v[i].y<v[j].y&&v[i].z<v[j].z)
            l[i]=l[j]+1;
            if(l[i]==0)
            l[i]=1;
        }
        maxi=0;
        for(i=1;i<=n;++i)
        if(l[i]>maxi)
        maxi=l[i];
        g<<maxi<<'\n';
    }
    return 0;
}