#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int N=1e5+10;
int n,a[N][3],p[N],mn[N],ans[N];
int main(){
    int T,la;scanf("%d",&T);while(T--){
        scanf("%d",&n);rep(i,1,n) rep(j,0,2) scanf("%d",&a[i][j]),mn[i]=0;
        rep(op,0,2){
            iota(p+1,p+n+1,1);sort(p+1,p+n+1,[&](int A,int B){return a[A][op]<a[B][op];});
            la=0;rep(i,1,n) if(a[p[i]][op]!=a[p[i+1]][op]) {rep(j,la+1,i) mn[p[j]]=max(mn[p[j]],i-la);la=i;}
        }
        rep(i,0,n) ans[i]=0;rep(i,1,n) ++ans[mn[i]-1];
        per(i,n-1,0) ans[i]+=ans[i+1];
        rep(i,0,n-1) printf("%d ",n-ans[i]);puts("");
    }
    return 0;
}