#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
#define maxn 3501


class cutie
  {
  public:
    int z;
	int x;
	int y;

  } t[maxn];


bool cmp( cutie a, cutie b)
   {
     return a.z < b.z;
   }

int main()
{
  FILE *in=fopen("cutii.in","r"),*out=fopen("cutii.out","w");

  int N,T,RESULT,MAX;

  fscanf(in,"%d",&N);
  fscanf(in,"%d",&T);


while(T--)
  {

    vector<cutie> v1;

    for(int i=0;i<N;i++)
	{
		fscanf(in,"%d",&t[i].x);
		fscanf(in,"%d",&t[i].y);
		fscanf(in,"%d",&t[i].z);

		v1.push_back(t[i]);
	}

   sort(v1.begin(), v1.end(),cmp );


   MAX=1;
  for(int i=0;i<N-1;i++)
  {
     RESULT=1;
     for(int j=i+1;j<N;j++)
      if(v1[j].z!=v1[j-1].z && v1[j].x > v1[j-1].x && v1[j].y > v1[j-1].y)RESULT++;

     if(RESULT>MAX)MAX=RESULT;


  }

  fprintf(out,"%d\n",MAX);

  }



}