#include<iostream>
#include<map>
#include<algorithm>
using namespace std;
const int N=100005;
int x[N],y[N],z[N],a[N];
map<pair<int,int>,int> mp;
int main()
{
    int t;
    cin>>t;
    while (t--)
    {
        mp.clear();
        int n;
        cin>>n;
        for (int i=0;i<n;i++)
        {
            cin>>x[i]>>y[i]>>z[i];
            mp[{0,x[i]}]++;
            mp[{1,y[i]}]++;
            mp[{2,z[i]}]++;
        }
        for (int i=0;i<n;i++)
        {
            a[i]=max(mp[{0,x[i]}]-1,max(mp[{1,y[i]}]-1,mp[{0,z[i]}]-1));
        }
        sort(a,a+n);
        int ans=0,ai=0;
        for (int i=0;i<n;i++)
        {
            while (ai<n&&a[ai]<i)
            {
                ans++;
                ai++;
            }
            cout<<ans<<" ";
        }
        cout<<endl;
    }
    return 0;
}