#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
#define int ll
typedef pair<int, int> PII;
const int N = 2e5 + 5, INF = 0x3f3f3f3f;

struct Node
{
    int x, y, z;
    int numx = 0, numy = 0, numz = 0;
};

void solve()
{

    int n;
    cin >> n;
    vector<int> X(N), Y(N), Z(N);
    vector<Node> a(n+1);
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i].x >> a[i].y >> a[i].z;
        X[a[i].x]++;
        Y[a[i].y]++;
        Z[a[i].z]++;
    }
    for (int i = 1; i <= n; i++)
    {
        a[i].numx = X[a[i].x] - 1;
        a[i].numy = Y[a[i].y] - 1;
        a[i].numz = Z[a[i].y] - 1;
    }
    vector<int> D;
    for (int i = 1; i <= n; i++)
    {
        D.push_back(max(max(a[i].numx, a[i].numy), a[i].numz));
    }
    vector<int> E(n + 10);
    for (int i = 0; i < n; i++)
    {
        E[D[i]+1]++;
    }
    for (int i = 1; i <= n; i++)
        E[i] += E[i - 1];
    for (int i = 0; i < n; i++)
    {
        // cout << "----" << endl;
        cout << E[i] << " ";
    }
    cout << endl;
}

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