#include <bits/stdc++.h>
using namespace std;
int n, a[3][100010], f[3][100010];
bool bk[100010], b[3][100010];
vector<int> c[3][100010];
struct Node{
	int id, tp, x;
	bool operator <(const Node u) const{ return x > u.x; }
};
priority_queue<Node> q;
int calc(int x){ return max(max(f[0][a[0][x]], f[1][a[1][x]]), f[2][a[2][x]]); }
void del(int x){
	int i, j;
	for(i = 0; i < 3; i++){
		j = a[i][x];
		f[i][j]--;
		q.push({j, i, f[i][j]});
	}
}
void solve(){
	int i, j, p, u, v, res = 0;
	scanf("%d", &n);
	for(i = 1; i <= n; i++){
		scanf("%d%d%d", &a[0][i], &a[1][i], &a[2][i]);
		f[0][a[0][i]]++; f[1][a[1][i]]++; f[2][a[2][i]]++;
		c[0][a[0][i]].push_back(i); c[1][a[1][i]].push_back(i); c[2][a[2][i]].push_back(i);
		bk[i] = false;
	}
	for(i = 1; i <= n; i++){
		for(j = 0; j < 3; j++){
			p = a[j][i];
			q.push({p, j, f[j][p]});
		}
	}
	for(i = 0; i < n; i++){
		while(q.size() > 0){
			if(q.top().x > i) break;
			j = q.top().id; p = q.top().tp; q.pop();
			if(b[p][j]) continue;
			b[p][j] = true;
			for(u = 0; u < c[p][j].size(); u++){
				v = c[p][j][u];
				if(calc(v) <= i && !bk[v]) del(v), bk[v] = true, res++;
			}
		}
		printf("%d ", res);
	}
	printf("\n");
	for(i = 1; i <= n; i++){
		for(j = 0; j < 3; j++){
			c[j][a[j][i]].clear(); b[j][a[j][i]] = false; f[j][a[j][i]] = 0;
		}
	}
}
int main()
{
	int t;
	scanf("%d", &t);
	while(t--) solve();
	return 0;
}