#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("cutii.in");
ofstream fout("cutii.out");
struct cutie{int x,y,z;}a[3505];
int n,t,d[3505],j,mx;
inline bool cmp(cutie A, cutie B)
   {return A.x<B.x;
   }

int main()
{int i;
 fin>>n>>t;
 while(t)
 {mx=0;
  for(i=1;i<=n;i++)
    {fin>>a[i].x>>a[i].y>>a[i].z;
     d[i]=1;
    }
 sort(a+1,a+n+1,cmp);
 t--;
 for(i=1;i<=n;i++)
    {for(j=i-1;j>=1;j--)
        {if(a[i].y>a[j].y&&a[i].z>a[j].z)d[i]=max(d[i],d[j]+1);
        }
        mx=max(d[i],mx);
    }
  fout<<mx<<"\n";
 }
}