#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef long double ld;
#define N 201000
#define endl '\n'
ll mod = 998244353;
int vis[N], x, y, z, n, cnt;
vector<int> a[N],b[N],c[N];
map<int, int>mp;
void solve() {
    cin >> n;
    mp.clear();
    vector<int> a[N], b[N], c[N];
    for (int i = 1; i <= n; i++) {
        vis[i] = 0;
        cin >> x >> y >> z;
        a[x].push_back(i);
        b[y].push_back(i);
        c[z].push_back(i);
    }
    for (int i = 1; i <= 1e5; i++) {
        for (int j = 0; j < a[i].size(); j++) {
            vis[a[i][j]] = max(int(a[i].size()), vis[a[i][j]]);
        }
    }
    for (int i = 1; i <= 1e5; i++) {
        for (int j = 0; j < b[i].size(); j++) {
            vis[b[i][j]] = max(int(b[i].size()), vis[b[i][j]]);
        }
    }
    for (int i = 1; i <= 1e5; i++) {
        for (int j = 0; j < c[i].size(); j++) {
            vis[c[i][j]] = max(int(c[i].size()), vis[c[i][j]]);
        }
    }
    cnt = 0;
    for (int i = 1; i <= n; i++) {
        mp[vis[i]] ++;
    }
    for (int i = 1; i <= n; i++) {
        cout << cnt << ' ';
        if (mp.size() && (*mp.begin()).first == i) {
            cnt += mp.begin()->second;
            mp.erase(mp.begin());
        }
        
   }
    cout << endl;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

}


ll qpow(ll x, ll y) {
    ll sum = 1;
    while (y) {
        if (y & 1)sum = sum * x % mod;
        y >>= 1;
        x = x * x % mod;
    }
    return sum;
}