#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PII;
typedef pair<ll, PII> PPI;

bool cmp(PPI x, PPI y)
{
    return x > y;
}

void solve()
{
    int n;
    cin >> n;
    int maxn = 1e5 + 1;
    vector<vector<vector<int>>> thing(3, vector<vector<int>>(maxn));
    vector<int> st(n + 1);
    for (int i = 1; i <= n; i ++ )
    {
        int x, y, z;
        cin >> x >> y >> z;
        thing[0][x].push_back(i);
        thing[1][y].push_back(i);
        thing[2][z].push_back(i);
    }
    vector<PPI> heap;
    for (int i = 0; i < 2; i ++ )
        for (int j = 1; j <= maxn; j ++ )
            if (!thing[i][j].empty())
                heap.push_back({thing[i][j].size(), {i, j}});
    sort(heap.begin(), heap.end(), cmp);
    vector<int> ans(n);
    int now = 0, res = 0;
    for (int i = n - 1; i >= 0; i -- )
    {
        if (now >= heap.size()) break;
        while (now < heap.size() && heap[now].first - 1 >= i)
        {
            int fir = heap[now].second.first, sec = heap[now].second.second;
            for (auto t : thing[fir][sec])
            {
                if (st[t]) continue;
                st[t] = 1, res ++ ;
            }
            now ++ ;
        }
        ans[i] = n - res;
    }
    for (int i = 0; i < n; i ++ ) cout << ans[i] << " \n"[i == n - 1];
}

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