//Cut it out, you've already lost.
#include<bits/stdc++.h>
using namespace std;
const int maxn=500005;
int n,m,T,tot;
int a[maxn],b[maxn],c[maxn],ans[maxn],del[maxn];
map<int,int>mp[3];
map<int,vector<int>>ps[3];
priority_queue< pair<int,pair<int,int>> >q;
int main(){
	scanf("%d",&T);
	while(T--){
		mp[0].clear(),mp[1].clear(),mp[2].clear();
		ps[0].clear(),ps[1].clear(),ps[2].clear();
		scanf("%d",&n);
		for(int i=1;i<=n;i++){
			scanf("%d%d%d",&a[i],&b[i],&c[i]),del[i]=0;
			ps[0][a[i]].emplace_back(i);
			ps[1][b[i]].emplace_back(i);
			ps[2][c[i]].emplace_back(i);
			mp[0][a[i]]++,mp[1][b[i]]++,mp[2][c[i]]++;
		}
		for(int d=0;d<=2;d++)
			for(map<int,int>::iterator it=mp[d].begin();it!=mp[d].end();it++)
				q.push(make_pair(-(it->second),make_pair(d,it->first)));
		for(int i=0;i<=n;i++)
			ans[i]=n;
		tot=0;
		while(!q.empty()){
			int val=-q.top().first;
			int typ=q.top().second.first,id=q.top().second.second;
			q.pop();
			if(val<=0||mp[typ][id]!=val)
				continue;
//			printf("val=%d typ=%d id=%d\n",val,typ,id);
			if(val>0)
				ans[val-1]=min(ans[val-1],tot);
			for(int i=0;i<ps[typ][id].size();i++){
				int x=ps[typ][id][i];
				del[x]++;
				if(del[x]==3){
//					printf("delete x=%d\n",x);
					tot++;
					mp[0][a[x]]--,mp[1][b[x]]--,mp[2][c[x]]--;
					q.push(make_pair(-mp[0][a[x]],make_pair(0,a[x])));
					q.push(make_pair(-mp[1][b[x]],make_pair(1,b[x])));
					q.push(make_pair(-mp[2][c[x]],make_pair(2,c[x])));
				}
			}
		}
		for(int i=n-1;i>=0;i--)
			ans[i]=min(ans[i],ans[i+1]);
		for(int i=0;i<n;i++)
			printf("%d%c",ans[i],i==n-1? '\n':' ');
	}
	return 0;
}