#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 x[N], y[N], z[N];
int n;

void solve()
{
    cin >> n;
    map<int, int> x, y, z;
    for (int i = 0; i < n; i++)
    {
        int t1, t2, t3;
        cin >> t1 >> t2 >> t3;
        x[t1]++;
        y[t2]++;
        z[t3]++;
    }
    priority_queue<int, vector<int>, greater<int>> q1, q2, q3;
    int s1 = n;
    int s2 = n;
    int s3 = n;
    for (auto t : x)
        q1.push(t.second);

    for (auto t : y)
        q2.push(t.second);
    for (auto t : z)
        q3.push(t.second);
    for (int i = 0; i < n; i++)
    {
        while (q1.size() && q1.top() < i + 1)
        {
            int t = q1.top();
            q1.pop();
            s1--;
            if (t - 1 >= 1)
                q1.push(t - 1);
        }
        while (q2.size() && q2.top() < i + 1)
        {
            int t = q2.top();
            q2.pop();
            s2--;
            if (t - 1 >= 1)
                q2.push(t - 1);
        }
        while (q3.size() && q3.top() < i + 1)
        {
            int t = q3.top();
            q3.pop();
            s3--;
            if (t - 1 >= 1)
                q3.push(t - 1);
        }
        cout << n - max(s1, max(s2, s3)) << ' ';
    }
    cout << endl;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
}