#include<cstdio>
#include<algorithm>
using namespace std;
struct P
{
     int x,y,z;
};
P p[3501];
int i,n,t,l[3501],m,k;
 
int C(P a,P b)
{
     return a.x<b.x;
}
 
int main()
{
     freopen("cutii.in","r",stdin),
     freopen("cutii.out","w",stdout),
     scanf("%d%d",&n,&t);
     while(t--)
     {
           for(i=1;i<=n;i++)
                  scanf("%d%d%d",&p[i].x,&p[i].y,&p[i].z);
           sort(p+1,p+n+1,C);
           l[n]=1;
           for(k=n-1;k;k--)
           {
                  for(m=0,i=k+1;i<=n;i++)
                  if(l[i]>m&&p[i].y>p[k].y&&p[i].z>p[k].z)
                         m=l[i];
                  l[k]=1+m;
           }
           m=l[1];
           for(i=2;i<=n;i++)
           if(l[i]>m)
                  m=l[i];
           printf("%d\n",m);
     }
}