#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
const int MX=100010;

int T, N;
int nx[MX], ny[MX], nz[MX];
int ans[MX];
int read()
{
    int r=0, f=1; char ch=getchar();
    while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=getchar();}
    while(ch>='0'&&ch<='9') {r=r*10+ch-'0'; ch=getchar();}
    return r*f;
}
struct pl
{
    int x, y, z;
    bool operator < (const pl &a)const
    {
        return max(nx[x],max(ny[y],nz[z])) > max(nx[a.x],max(ny[a.y],nz[a.z]));
    }
};
priority_queue<pl> q;
int main()
{
    // freopen("testdata.in","r",stdin);
    T=read();
    while(T--)
    {
        N=read();
        for(int i=1;i<=N;i++)
        {
            int x=read(), y=read(), z=read();
            nx[x]++, ny[y]++, nz[z]++;
            q.push({x,y,z});
        }
        int num=0;
        for(int i=1;i<=N+1;i++)
        {
            while(!q.empty())
            {
                auto [x,y,z] = q.top();
                int den=max(nx[x],max(ny[y],nz[z]));
                // cout << "x=" << x << ", y=" << y << ", z=" << z << ", den=" << den << '\n';
                if(den<i) 
                {
                    num++;
                    nx[x]--; ny[y]--; nz[z]--;
                    q.pop();
                }
                else break;
            }
            if(i!=N+1) cout << num << " ";
        }
        cout << '\n';
    }
    return (0-0);
}