#include <iostream>
#include <cstring>
#include <algorithm>
#define MAXN 100001
using namespace std;

struct node
{
	int x, y, z;
} s[MAXN];

int cnt[MAXN], ans[MAXN];

bool cmp1(node a, node b)
{
	return a.x < b.x;
}

bool cmp2(node a, node b)
{
	return a.y < b.y;
}

bool cmp3(node a, node b)
{
	return a.z < b.z;
}

int main()
{
	int T, n;
	cin >> T;
	while(T--)
	{
		memset(cnt, 0, sizeof(cnt));
		memset(ans, 0, sizeof(ans));
		cin >> n;
		for(int x = 0; x < n; x++) cin >> s[x].x >> s[x].y >> s[x].z;
		sort(s, s+n, cmp1);
		int sti = 0;
		for(int x = 0; x < n; x++)
		{
			if(x == 0) continue;
			if(s[x].x != s[x-1].x)
			{
				for(int y = sti; y < x; y++) cnt[y] = max(cnt[y], x-sti-1);
				sti = x;
			}
		}
		for(int y = sti; y < n; y++) cnt[y] = max(cnt[y], n-sti-1);
		sort(s, s+n, cmp2);
		sti = 0;
		for(int x = 0; x < n; x++)
		{
			if(x == 0) continue;
			if(s[x].y != s[x-1].y)
			{
				for(int y = sti; y < x; y++) cnt[y] = max(cnt[y], x-sti-1);
				sti = x;
			}
		}
		for(int y = sti; y < n; y++) cnt[y] = max(cnt[y], n-sti-1);
		sort(s, s+n, cmp3);
		sti = 0;
		for(int x = 0; x < n; x++)
		{
			if(x == 0) continue;
			if(s[x].z != s[x-1].z)
			{
				for(int y = sti; y < x; y++) cnt[y] = max(cnt[y], x-sti-1);
				sti = x;
			}
		}
		for(int y = sti; y < n; y++) cnt[y] = max(cnt[y], n-sti-1);
		
		sort(cnt, cnt+n);
		
//		for(int x = 0; x < n; x++) cout << cnt[x] << " ";
//		cout << endl;
		
		for(int x = 0; x < n; x++) ans[cnt[x]]++;
		int tmp = 0;
		for(int x = 0; x < n; x++)
		{
			cout << tmp << " ";
			tmp += ans[x];
		}
		cout << endl;
	}
	return 0;
}