#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#define ALL(v) v.begin(),v.end()
#define For(i,_) for(int i=0,i##end=_;i<i##end;++i) // [0,_)
#define FOR(i,_,__) for(int i=_,i##end=__;i<i##end;++i) // [_,__)
#define Rep(i,_) for(int i=(_)-1;i>=0;--i) // [0,_)
#define REP(i,_,__) for(int i=(__)-1,i##end=_;i>=i##end;--i) // [_,__)
typedef long long ll;
typedef unsigned long long ull;
#define V vector
#define pb push_back
#define pf push_front
#define qb pop_back
#define qf pop_front
#define eb emplace_back
typedef pair<int,int> pii;
typedef pair<ll,int> pli;
#define fi first
#define se second
const int dir[4][2]={{-1,0},{0,1},{1,0},{0,-1}},inf=0x3f3f3f3f,mod=1e9+7;
const ll infl=0x3f3f3f3f3f3f3f3fll;
template<class T>inline bool ckmin(T &x,const T &y){return x>y?x=y,1:0;}
template<class T>inline bool ckmax(T &x,const T &y){return x<y?x=y,1:0;}
int init=[](){return cin.tie(nullptr)->sync_with_stdio(false),0;}();
template<class T>
struct disc{
	// 0-indexed
	vector<T>d;
	inline disc(){}
	inline void insert(const T &x){d.pb(x);}
	inline void insert(const V<T> &v){d.insert(d.end(),ALL(v));}
	inline void init(){sort(ALL(d));d.erase(unique(ALL(d)),d.end());}
	inline disc(const vector<T> &v){d=move(v);init();}
	inline int query(const T &x){return lower_bound(ALL(d),x)-d.begin();}
	inline int size(){return d.size();}
};
int main(){
    int t_case=1;
    scanf("%d",&t_case);
    while(t_case--){
        int n;
        scanf("%d",&n);
        V<int>x(n),y(n),z(n);
        For(i,n)scanf("%d%d%d",&x[i],&y[i],&z[i]);
        disc<int>dx(x),dy(y),dz(z);
        V<int>X(dx.size()),Y(dy.size()),Z(dz.size());
        For(i,n)++X[x[i]=dx.query(x[i])],++Y[y[i]=dy.query(y[i])],++Z[z[i]=dz.query(z[i])];
        V<int>mx(dx.size(),inf),my(dy.size(),inf),mz(dz.size(),inf);
        For(i,n)ckmin(mx[x[i]],max({X[x[i]],Y[y[i]],Z[z[i]]})),ckmin(my[y[i]],max({X[x[i]],Y[y[i]],Z[z[i]]})),ckmin(mz[z[i]],max({X[x[i]],Y[y[i]],Z[z[i]]}));
        V<int>ans(n);
        For(i,n)++ans[min({mx[x[i]],my[y[i]],mz[z[i]]})];
        For(i,n){
            if(i)ans[i]+=ans[i-1];
            printf("%d%c",ans[i]," \n"[i+1==n]);
        }
    }
    return 0;
}