#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("cutii.in");
ofstream g("cutii.out");
int n,m,s,i,x[35001],p,u,t[35001],teste;
struct pie
{
    int x,y,z;
}a[3501];
int cmp(pie a,pie b)
{
    if(a.x>b.x)
    return a.x<b.x;
    else if(a.x<b.x)
    return a.x>b.x;
    else if(a.x==b.x&&a.y>b.y)
    return a.y<b.y;
    else if(a.x==b.x&&a.y<b.y)
    return a.y>b.y;
    else if(a.x==b.x&&a.y==b.y&&a.z>b.z)
    return a.z<b.z;
    else if(a.x==b.x&&a.y==b.y&&a.z<b.z)
    return a.z>b.z;
}
int main()
{
    f>>n>>teste;
    while(teste)
    {
        teste--;
        for(i=1;i<=n;i++)
        f>>a[i].x>>a[i].y>>a[i].z;
        sort(a+1,a+n+1,cmp);
      x[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].z>a[x[m]].z)
                p=m+1;
                else
                u=m-1;
          }
          if(p>s)
            s++;
          x[p]=i;
          t[i]=x[p-1];
      }
      g<<s<<"\n";

    }
}