#include <bits/stdc++.h>
using namespace std;

int solve(vector<vector<int>>& v)
{
	sort(v.begin(), v.end());
	int n = v.size(), dp[n], ans = 0;
	
	for(int i = 0;i < n;++i)
	{
		dp[i] = 1;
		for(int j = i - 1;j >= 0;--j)
		{
			if(v[i][1] > v[j][1] && v[i][2] > v[j][2])
				dp[i] = max(dp[i], 1 + dp[j]);
		}
		ans = max(ans, dp[i]);
	}
	return ans;
}


int main() {
	freopen("cutii.in", "r", stdin);
	freopen("cutii.out", "w", stdout);
	int n, t;
	cin >> n >> t;
	
	for(int i = 0;i < t;++i)
	{
		vector<vector<int>> v(n, vector<int>(3));
		for(int j = 0;j < n;++j)
			cin >> v[j][0] >> v[j][1] >> v[j][2];
		cout << solve(v) << "\n";
	}
}