const int N = 100000 + 5;
 int a[N], b[N], rt[N * 20], ls[N * 20], rs[N * 20], sum[N * 20];
class Solution {
public:
   



int n, k, tot, sz, ql, qr, x, q, T;
vector<int>out;
void Build(int& o, int l, int r){
    if(l>r)return ;
    o = ++ tot;
    sum[o] = 0;
    if(l == r) return;
    int m = (l + r) >> 1;
    Build(ls[o], l, m);
    Build(rs[o], m + 1, r);
}

int update(int& o, int l, int r, int last, int p){
    o = ++ tot;
    ls[o] = ls[last];
    rs[o] = rs[last];
    sum[o] = sum[last] + 1;
    if(l == r) return l;
    int m = (l + r) >> 1;
    if(p <= b[m])  return update(ls[o], l, m, ls[last], p);
    else return update(rs[o], m + 1, r, rs[last], p);
}

int query(int ss, int tt, int l, int r, int k){
    if(l == r) return l;
    int m = (l + r) >> 1;
    int cnt = sum[ls[tt]] - sum[ls[ss]];
    if(k <= cnt) return query(ls[ss], ls[tt], l, m, k);
    else return query(rs[ss], rs[tt], m + 1, r, k - cnt);
}

int sumq(int cur,int l1,int r1,int l,int r)
{
 if(l1<0||r1<0)return 0;
 if(l1<=l&&r1>=r)return sum[cur];
 int mid=(l+r)/2;
 int ans=0;
 if(l1<=mid)ans+= sumq(ls[cur],l1,r1,l,mid);
 if(r1>mid)ans+= sumq(rs[cur],l1,r1,mid+1,r);
 return ans;
}


 vector<int> countSmaller(vector<int>& nums){//freopen("t.txt","r",stdin);
   T=1; 
    while(T--){
        for(int i = 0; i < nums.size(); i ++)b[i] = nums[i];
        sort(b , b + (int)nums.size());
        out.resize((int)nums.size());
        sz = unique(b , b +(int)nums.size()) - (b );
        sz--;
        tot=0;
        Build(rt[nums.size()],0, sz);
        
        for(int i = nums.size()-1; i >= 0; i --)
		{
		  int loc=update(rt[i], 0, sz, rt[i + 1], nums[i]);
		  out[i]=sumq(rt[i],0,loc-1,0,sz);
		}
    
	 
    }
   return out;
}
};