#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<vector>
#include<queue>
#include<stack>
#include<ctime>
#define pii pair<int,int>
#define pb push_back
#define LL long long
#define mp make_pair
#define fi first
#define se second
using namespace std;
inline int read(){
    int f=1,ans=0; char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9'){ans=ans*10+c-'0';c=getchar();}
    return f*ans;
}
const int MAXN=1e5+11;
int cas,N,A[MAXN],vis[MAXN];
struct Segment{
    int Ans[MAXN<<2];
    void build(int k,int l,int r){
        Ans[k]=0; if(l==r) return;
        int mid=(l+r)>>1; build(k<<1,l,mid),build(k<<1|1,mid+1,r); return;
    }
    void Add(int k,int l,int r,int pos){
        Ans[k]++; if(l==r) return;
        int mid=(l+r)>>1; if(pos<=mid) Add(k<<1,l,mid,pos); if(mid<pos) Add(k<<1|1,mid+1,r,pos);
        return;
    }
    int Query(int k,int l,int r,int x,int y){
        if(x>y) return 0;
        if(x<=l&&r<=y) return Ans[k];
        int mid=(l+r)>>1,ret=0;
        if(x<=mid) ret+=Query(k<<1,l,mid,x,y);
        if(mid<y) ret+=Query(k<<1|1,mid+1,r,x,y);
        return ret;
    }
    void Ins(int x){
        if(!vis[x]){vis[x]=1; Add(1,1,N,x); return;}
        return;
    }
}Seg;
int main(){
    //freopen("1.in","r",stdin);
    cas=read(); while(cas--){
        N=read(); for(int i=1;i<=N;i++) A[i]=read(),vis[i]=0; Seg.build(1,1,N);
        int Maxn=A[1]; Seg.Ins(A[1]); printf("0"); LL Ans=0;
        for(int i=2;i<=N;i++){
            if(A[i]<=Maxn) {
                Ans+=Seg.Query(1,1,N,A[i]+1,N);
                Seg.Ins(A[i]);
            }else{
                Ans+=2; Seg.Ins(A[i]); Maxn=A[i];
            }
            printf(" %lld",Ans);
        }printf("\n");
    }
}