#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define N_MAX 3501

struct cutie{
	int x,y,z;
} A[N_MAX];

int N,T,V[N_MAX][N_MAX];

int cmp(const void *i, const void *j){
	cutie *ei= (cutie *) i;
	cutie *ej= (cutie *) j;
	return ei->x - ej->x;
}

int bit (int x){
	return (x&(x-1))^x;
}

int suma(int x,int y){
	int i,j,s=0;
	for (i=x;i>0;i-=bit(i))
		for (j=y;j>0;j-=bit(j))
			s+=V[i][j];
	return s;
}

int adauga(int x, int y, int z){
	int i,j,x1,y1,s,p1,p2;
	V[x][y]+=z;
	s=suma(x,y);
	x1=x;y1=y;
	for (i=x;i<=N;i+=bit(i)){
		if (x1-bit(x1)>0)
			x1-=bit(x1);
		else x1=0;
		for (j=y;j<=N;j+=bit(j)){
			if(y1-bit(y1)>0)
				y1-=bit(y1);
			else
				y1=0;
			p1=suma(x1,y1);
			if (x1==y1==0)
				p2=0;
			else
				p2=suma(i,j);
			if (s-p1>p2)
				V[i][j]=s-p1;
		}
	}
	return s;
}


int main(){
	int k,i,max,s;
	FILE *fin=fopen("cutii.in","r");
	FILE *fout=fopen("cutii.out","w");
	fscanf(fin,"%d %d",&N,&T);
	for (k=1;k<=T;k++){
		for (i=0;i<N;i++)	
			fscanf(fin,"%d %d %d",&A[i].x,&A[i].y,&A[i].z);
		qsort(A,N,sizeof(cutie),cmp);
		max=0;
		for (i=0;i<N;i++){
			s=adauga (A[i].y,A[i].z,1);
			if (s>max)
				max=s;
		}
		fprintf(fout,"%d\n",max);
		memset(V,0,sizeof(V));
	}
	fclose(fin);
	fclose(fout);
	return 0;
}