#include<algorithm>
using namespace std;
#define DIM 3505
struct ok
{
    int x,y,z,s;
} a[DIM];
int cmp (ok a,ok b)
{
    return a.x>b.x || (a.x==b.x && (a.y>b.y || (a.y==b.y && a.z>=b.z)));
}
int main ()
{
    freopen("cutii.in","r",stdin);
    freopen("cutii.out","w",stdout);
    int q,t,n,i,j,rez,maxim;;
    scanf("%d%d",&n,&t);
    for(q=1;q<=t;++q)
    {
        rez=0;
        for(i=1;i<=n;++i)
            scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].z),a[i].s=0;
        sort(1+a,1+a+n,cmp);
        for(i=1;i<=n;++i)
        {
            maxim=0;
            for(j=1;j<i;++j)
                if(a[i].x<a[j].x && a[i].y<a[j].y && a[i].z<a[j].z)
                    if(maxim<a[j].s)
                        maxim=a[j].s;
            a[i].s=maxim+1;
            if(rez<a[i].s)
                rez=a[i].s;
        }
        printf("%d\n",rez);
    }
    return 0;
}