#include <bits/stdc++.h>

using namespace std;

struct Box
{
	int x, y, z;
};

bool cmp(Box a, Box b)
{
	return a.x < b.x;
}

const int DIM = 3507;

Box v[DIM];
int best[DIM];

int n, t, k, i, j;

int main()
{
	freopen("cutii.in","r",stdin);
	freopen("cutii.out","w",stdout);
	
	scanf("%d%d", &n, &t);
	
	for(k = 1; k <= t; k++)
	{
		for(i = 1; i <= n; i++)
		{
			scanf("%d%d%d", &v[i].x, &v[i].y, &v[i].z);
		}
		
		sort(v + 1, v + 1 + n, cmp);
		
		int mx = 0;
		
		for(i = 1; i <= n; i++)
		{
			best[i] = 1;
			
			for(j = 1; j < i; j++)
				if(v[i].y > v[j].y && v[i].z > v[j].z)
				{
					best[i] = max(best[i], best[j] + 1);
				}
			mx = max(mx, best[i]);
		}
		
		printf("%d\n",mx);
	}
}