#include <bits/stdc++.h>
using namespace std;
#define int long long 
const int N=2e5+10;
int n,m;
int x[N];
int y[N];
int z[N];
int dx[N];
int dy[N];
int dz[N];
int d[N];
priority_queue<int,vector<int> ,greater<int> > q;
priority_queue<int,vector<int> ,greater<int> > q2;
void solve(){
    for(int i=1;i<=100000;i++){
        dx[i]=0;
        dy[i]=0;
        dz[i]=0;
    }
    cin >> n;
    for(int i=1;i<=n;i++){
        int a,b,c;
        cin >> a >> b >> c;
        x[i]=a;
        y[i]=b;
        z[i]=c;
        dx[a]++;
        dy[b]++;
        dz[c]++;
    }
    
    while(q.size()!=0){
        q.pop();
    }
    while(q2.size()!=0){
        q2.pop();
    }
    for(int i=1;i<=n;i++){
        int num1=dx[x[i]]-1;
        int num2=dy[y[i]]-1;
        int num3=dz[z[i]]-1;
        d[i]=max(num1,max(num2,num3));
        //cout <<  d[i] << ' ';
    }
    for(int i=1;i<=n;i++){
        q.push(d[i]);
        q2.push(d[i]);
    }
    //cout << "--" << q.top() << ' ';
    for(int k=0;k<=n-1;k++){
        q=q2;
        int cnt=0;
        while(q.size()!=0&&q.top()<k){
            cnt++;
            q.pop();
        }
        cout << cnt << ' ';
    }
    cout << endl;
}
signed main(){
    int T;
    cin >> T;
    while(T--){
        solve();
    }
}