#include <fstream>
#include <algorithm>

using namespace std;
ifstream fin("cutii.in");
ofstream fout("cutii.out");

struct box{

long long l,c,h;

long long x;

}a[6000];


long long n,i,s,maxx,max_tot,l,c,h;

bool cmp(box a, box b)
{
    return ((long long)a.l * a.c * a.h < (long long)b.l * b.c* b.h);
}

int t,y;


int main()
{
    fin>>n>>t;
    for(y=1;y<=t;y++)
    {

        max_tot=0;

        for(i=1;i<=n;i++)
        {
            fin>>l>>c>>h;


            a[i].l=l;
            a[i].c=c;
            a[i].h=h;
            a[i].x=0;
        }

        sort(a+1,a+n+1,cmp);

        for(i=1;i<=n;i++)
        {

            maxx=0;

            for(int j=1;j<i;j++)
                if(a[i].l>a[j].l && a[i].c>a[j].c && a[i].c>a[j].c)
                    if(a[j].x>maxx)
                        maxx=a[j].x;
           a[i].x+=maxx+1;
           if(a[i].x>max_tot)
                max_tot=a[i].x;
        }

        fout<<max_tot<<'\n';
    }
    return 0;
}