#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e6 + 10;
#define pii pair<int, int>
#define lowbit(x) (x & (-x))
int n;
map<int, int> x, y, z;
struct node
{
    int xx, yy, zz;
    bool operator<(node p) const
    {
        return max(x[xx], max(y[yy], z[zz])) > max(x[p.xx], max(y[p.yy], z[p.zz]));
    }
};
void solve()
{
    cin >> n;
    priority_queue<node> q;
    x.clear();
    y.clear();
    z.clear();
    for (int i = 0; i < n; i++)
    {
        int t1, t2, t3;
        cin >> t1 >> t2 >> t3;
        x[t1]++;
        y[t2]++;
        z[t3]++;
        q.push({t1, t2, t3});
    }
    for (int i = 1; i <= n; i++)
    {
        while (q.size() && max(x[q.top().xx], max(y[q.top().yy], z[q.top().zz])) < i)
        {
            x[q.top().xx]--;
            y[q.top().yy]--;
            z[q.top().zz]--;
            q.pop();
        }
        cout << n - q.size() << ' ';
    }
    cout << endl;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
}