#include<stdio.h>
#include<algorithm>
using namespace std;

struct cutii{int x, y, z;}v[3502];

inline bool cmp(const cutii a, const cutii b)
{
	 if(a.x>b.x)
		 return a.x>b.x;
	 if(a.y>b.y)
		 return a.y>b.y;
	 return a.z>b.z;
}

int main()
{
FILE *g=fopen("cutii.in","r"), *f=fopen("cutii.out","w");
int i, n, t, ct;

fscanf(g,"%d%d", &n, &t);


while(t)
{
	 for(i=1;i<=n;i++)
		 fscanf(g,"%d%d%d", &v[i].x, &v[i].y, &v[i].z);
	 
	 sort(v+1, v+n+1, cmp);
	 
	 ct=n;
	 for(i=2;i<=n;i++)
		 if(!(v[i-1].x>v[i].x && v[i-1].y>v[i].y &&  v[i-1].z>v[i].z))
			 ct--;
	 
	 fprintf(f,"%d\n", ct);
	 t--;
}
return 0;
}