#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("cutii.in");
ofstream g("cutii.out");
int n,t,i,xx[3501],tt[3501],s,u,p,m;
struct box
{
    int x,y,z;
}a[3501];
int cmp(box a,box b)
{
    if(a.x!=b.x)
      return a.x<b.x;
    if(a.y!=b.y)
      return a.y<b.y;
    return a.z<b.z;
}
void reinit()
{
    for(i=0;i<=n;i++)
      a[i].x=a[i].y=a[i].z=xx[i]=tt[i]=0;
}
int main()
{
    f>>n>>t;
    while(t)
    {
        t--;
        for(i=1;i<=n;i++)
          f>>a[i].x>>a[i].y>>a[i].z;
        sort(a+1,a+n+1,cmp);


        xx[1]=1;
        p=1;
        s=1;
        for(i=2;i<=n;i++)
        {
            p=1;
            u=s;
            while(p<=u)
            {
                m=(u+p)/2;
                if(a[i].x>a[xx[m]].x&&a[i].y>a[xx[m]].y&&a[i].z>a[xx[m]].z)
                  p=m+1;
                else
                  u=m-1;
            }
            if(p>s)
              s++;
            xx[p]=i;
            tt[i]=xx[p-1];
        }
        g<<s<<"\n";
        reinit();


    }
    return 0;
}