#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAXN = 200005;
ll t;
ll n;
map <ll, ll> mpx, mpy, mpz;
struct node
{
	ll x, y, z;
}a[MAXN];
ll m[MAXN];
ll c[100005];

int main()
{
	cin >> t;
	while(t--)
	{
		cin >> n;
		memset(c, 0, sizeof(c));
		ll x, y, z;
		for(int i = 1;i <= n;i++)
		{
			cin >> x >> y >> z;
			mpx[x]++;
			mpy[y]++;
			mpz[z]++;
			a[i].x = x; a[i].y = y; a[i].z = z;
		}
		for(int i = 1;i <= n;i++)
		{
			m[i] = max(max(mpx[a[i].x], mpy[a[i].y]), mpz[a[i].z]) - 1;
			//cout << m[i] << " ";
			c[m[i]]++;
		}
		cout << 0 << " ";
		for(int i = 1;i <= n - 1;i++){
			c[i] = c[i - 1] + c[i];
			cout << c[i] << " ";
		}
		cout << endl;
		mpx.clear(); mpy.clear(); mpz.clear();
	}
	
	
	
	
	
	
	
	return 0;
}