#include<fstream>
#include<algorithm>
#include<cstring>
using namespace std;

typedef struct lol {
      int x,y,z;
}troll;

int a[3505],i,j,rs,t,n,aux;
troll c[3505];

bool cmp(const troll &a,const troll &b) {
    return a.x<b.x;
}

int main()
{
  ifstream cin("cutii.in");
  ofstream cout("cutii.out");

  cin>>n>>t;
  while(t--)
  {
    for(i=1;i<=n;++i) cin>>c[i].x>>c[i].y>>c[i].z;

    sort(c+1,c+n+1,cmp);

    for(a[1]=1,i=2;i<=n;++i)
      for(a[i]=1,j=1;j<i;++j)
      if(c[j].y<c[i].y && c[j].z<c[i].z && a[j]+1>a[i]) a[i]=a[j]+1;

    for(rs=1,i=1;i<=n;++i)
    if(rs<a[i]) rs=a[i];

    cout<<rs<<'\n';
    memset(a,0,sizeof(a));
  }

 return 0;
}