#include<bits/stdc++.h>
using namespace std;
#define int long long
#define INF 0x3f3f3f3f3f3f3f3f
#define pii pair<int,int>
#define fi first
#define se second
#define all(_a) _a.begin(), _a.end()
const int N=100010;

struct Node
{
    int x,y,z;
};

void solve(){
    int n;
    cin>>n;
    vector<int>st(n+1);
    map<int,vector<int>>mp[3];
    map<int,int>cnt[3];
    for(int i=1;i<=n;i++){
        int x,y,z;
        cin>>x>>y>>z;
        mp[0][x].push_back(i);
        mp[1][y].push_back(i);
        mp[2][z].push_back(i);

        cnt[0][x]++;
        cnt[1][y]++;
        cnt[2][z]++;
    }
    priority_queue<array<int,3>,vector<array<int,3>>,greater<array<int,3>>>q;
    for(int i=0;i<3;i++){
        for(auto v:cnt[i]){
            q.push({v.se,i,v.fi}); 
        }
    }
    int res=0;
    for(int i=0;i<n;i++){
        while(q.size()&&q.top()[0]<=i){
            int p=q.top()[1];
            int pos=q.top()[2];
            q.pop();
            for(auto v:mp[p][pos]){
                if(++st[v]==3)res++;
            }
        }
        cout<<res<<" ";
    }
    cout<<endl;

}   
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    cout << setiosflags(ios::fixed) << setprecision(15);
    int T;
    T=1;
    cin>>T;
    while(T--)solve();
    return 0;
}