#include<cstdio>

 #include<vector>

 #include<cstring>

 #include<iostream>

 #include<algorithm>

 using namespace std;

 int const MAX_Z=+;

 int const MAX_N=+;

 struct Ope{

     int x,y,z;

     int ty,id;

     Ope(int x,int y,int z,int ty,int id):x(x),y(y),z(z),ty(ty),id(id){}

     Ope(){}

 };

 bool cmp_x(Ope a,Ope b){

     if(a.x==b.x)return a.ty<b.ty;

     return a.x<b.x;

 }

 bool cmp_y(Ope a,Ope b){

     if(a.y==b.y)return a.ty<b.ty;

     return a.y<b.y;

 }

 vector<Ope> ope,ope2;

 //vector<int> allZ;

 vector<int>::iterator it;

 int tree[MAX_Z];

 int ans[MAX_Z];

 void add(int x,int a){

     while(x<MAX_Z){

         tree[x]+=a;

         x+=(x&(-x));

     }

 }

 int read(int x){

     int sum=;

     while(x){

         sum+=tree[x];

         x-=(x&(-x));

     }

     return sum;

 }

 void work(){

     for(int i=;i<ope2.size();i++){

         if(ope2[i].ty==) add(ope2[i].z,);

         else{

             int temp=read(ope2[i].z);

             ans[ope2[i].id]+=temp*ope2[i].ty;

         }

     }

     for(int i=;i<ope2.size();i++)

         if(ope2[i].ty==) add(ope2[i].z,-);

 }

 void CDQ(int L,int R){

     if(L>=R)return;

     int mid=(L+R)>>;

     CDQ(L,mid);

     ope2.clear();

     for(int i=L;i<=mid;i++){

         if(ope[i].ty==)

             ope2.push_back(ope[i]);

     }

     for(int i=mid+;i<=R;i++){

         if(ope[i].ty!=)

             ope2.push_back(ope[i]);

     }

     sort(ope2.begin(),ope2.end(),cmp_y);

     work();

     CDQ(mid+,R);

 }

 int main(){

     int T;

     int n;

     scanf("%d",&T);

     while(T--){

         scanf("%d",&n);

         ope.clear();

         //allZ.clear();

         memset(tree,,sizeof(tree));

         memset(ans,,sizeof(ans));

         for(int i=;i<=n;i++){

             int x,y,z;

             scanf("%d%d%d",&x,&y,&z);

             ope.push_back(Ope(x,y,z,,i));

             ope.push_back(Ope(x,y,z,,i));

             //allZ.push_back(z);

         }

         /*

         sort(allZ.begin(),allZ.end());

         it=unique(allZ.begin(),allZ.end());

         allZ.resize(distance(allZ.begin(),it));

         for(int i=0;i<ope.size();i++){

             ope[i].z=lower_bound(allZ.begin(),allZ.end(),ope[i].z)-allZ.begin()+1;

         }

         */

         sort(ope.begin(),ope.end(),cmp_x);

         CDQ(,ope.size()-);

         for(int i=;i<=n;i++){

             printf("%d\n",ans[i]-);

         }

     }

     return ;

 }