#include<bits/stdc++.h>

using namespace std;
#define int long long 
#define endl '\n'

void solve(){
    int n;
    cin >> n;
    vector<array<int, 3>> va(n);
    map<int, int> mmap1, mmap2, mmap3;
    for(int i = 0; i < n; i ++){
        cin >> va[i][0] >> va[i][1] >> va[i][2];
        mmap1[va[i][0]] ++, mmap2[va[i][1]] ++, mmap3[va[i][2]] ++;
    }
    vector<int> res(n);
    for(int i = 0; i < n; i ++){
        res[i] = max(mmap1[va[i][0]] - 1, max(mmap2[va[i][0]] - 1, mmap3[va[i][0]] - 1));
    }
    map<int, int> ans;
    for(int i = 0; i < n; i ++){
        ans[res[i]] ++;
    }
    int sum = 0;
    for(int i = 0; i < n; i ++){
        cout << sum << " ";
        sum += ans[i];
    }
    cout << endl;
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    int t;
    cin >> t;
    while(t --){
        solve();
    }
    return 0;
}