#include <bits/stdc++.h>
using namespace std;

struct Node {
    int x, y, z;
    int id, val;
};

void solve() {
    int n; cin >> n;
    vector<Node> p(n + 1);
    int max_X = 0, max_Y = 0, max_Z = 0;
    for (int i = 1; i <= n; i++) {
        p[i].id = i; cin >> p[i].x >> p[i].y >> p[i].z;
        max_X = max(max_X, p[i].x); max_Y = max(max_Y, p[i].y); max_Z = max(max_Z, p[i].z);
    }
    vector<vector<int>> X(max_X + 1, vector<int>()), Y(max_Y + 1, vector<int>()), Z(max_Z + 1,vector<int>());
    
    for (int i = 1; i <= n; i++) {
        X[p[i].x].push_back(i); Y[p[i].y].push_back(i); Z[p[i].z].push_back(i);
    }

    vector<int> v;

    for (int i = 1; i <= n; i++) {
        p[i].val = max({X[p[i].x].size(), Y[p[i].y].size(), Z[p[i].z].size()});
        v.push_back(p[i].val);
    }

    sort(v.begin(), v.end());

    int res = 0;
    for (int k = 1; k <= n; k++) {
        while (res < v.size() && v[res] < k) res ++;
        cout << res << " ";
    }
    cout << '\n';
}

int main() {
    // freopen ("J.in", "r", stdin);
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int T; cin >> T;
    while (T--) solve();
    return 0;
}