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