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

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

struct piv {
    vector<int> v;
    bool operator < (const piv b) const {
        return v.size() > b.v.size();
    }
};

bool operator < (vector<int> xx, vector<int> yy) {
    return xx.size() > yy.size();
}

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; p[i].val = 3;
        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);
    }

    using piv = pair<int, vector<int>>;
    priority_queue<vector<int>> pq;
    
    auto inp = [&] (vector<vector<int>> &X) {
        for (auto &v : X) {
            if (!v.empty())
                pq.push(v);
        }
    };

    inp(X), inp(Y), inp(Z);

    int res = 0;
    for (int k = 1; k <= n; k++) {
        while (!pq.empty() && pq.top().size() < k) {
            auto v = pq.top(); pq.pop();
            for (auto id : v) {
                if (--p[id].val == 0) res += 1;
            }
        }
        cout << res << " ";
    }

    cout << '\n';
}

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