#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("cutii.in");
ofstream g("cutii.out");
int n,t,i,j,l[3501],v[3501];
struct lungimi
{
    int x,y,z;
};
int cmp(lungimi a,lungimi b)
{
    if(a.x==b.x)
    {
        if(b.y==a.y)
        return a.z<b.z;
        return a.y<b.y;
    }
    return a.x<b.x;
}
lungimi a[3501],aux;
int main()
{
    f>>n>>t;
    while(t--)
    {
        for(i=1;i<=n;i++)
        f>>a[i].x>>a[i].y>>a[i].z;
        /*for(i=1;i<=n-1;i++)
        for(j=i+1;j<=n;j++)
        if(a[i].x>a[j].x)
        {
            aux=a[i];
            a[i]=a[j];
            a[j]=aux;
        }*/
        sort(a+1,a+n+1,cmp);
        l[n]=v[n]=1;
        for(i=n-1;i>=1;i--)
        {
            l[i]=1;
            for(j=i+1;j<=n&&v[j]>=l[i];j++)
                if(a[i].x<a[j].x&&a[i].y<a[j].y&&a[i].z<a[j].z)
                    l[i]=max(l[i],l[j]+1);
                v[i]=max(v[i+1],l[i]);
        }
        g<<v[1]<<"\n";
    }
    return 0;
}