#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<functional>
#include<utility>
#include<cassert>
#include<set>
using namespace std;
inline int read(){
    int x = 0,f = 1;
    char c = getchar();
    while(c < '0' || c > '9'){
        if(c == '-') f = -1;
        c = getchar();
    }
    while(c >= '0' && c <= '9'){
        x = (x << 3) + (x << 1) + (c ^ 48);
        c = getchar();
    }
    return x * f;
}
const int N = 1e5 + 11;
int n,m;
int a[N],b[N];
#define mid (l + r >> 1)
struct yjx{
    int tre[N << 2];
    void clear(int k,int l,int r){
        tre[k] = 0;
        if(l == r){
            return;
        }
        clear(k << 1,l,mid);
        clear(k << 1 | 1,mid + 1,r);
    }
    void modify(int k,int l,int r,int x){
        if(l == r){
            tre[k] = 1;
            return;
        }
        if(x <= mid) modify(k << 1,l,mid,x);
        else modify(k << 1 | 1,mid + 1,r,x);
        tre[k] = tre[k << 1] + tre[k << 1 | 1];
    }
    int query(int k,int l,int r,int x,int y){
        if(x > y) return 0;
        if(x <= l && r <= y){
            return tre[k];
        }
        int ret = 0;
        if(x <= mid) ret = query(k << 1,l,mid,x,y);
        if(y > mid) ret += query(k << 1 | 1,mid + 1,r,x,y);
        return ret;
    }
}str;
int main(){
    int t,i,j,k,x,y;
    t = read();
    while(t--){
        n = read();
        int mx = 0;
        long long cnt = 0;
        str.clear(1,1,n);
        for(i = 1;i <= n;i++) a[i] = read();
        for(i = 1;i <= n;i++) b[i] = 0;
        for(i = 1;i <= n;i++){
            if(i > 1){
                if(a[i] > mx) cnt += 1ll * (b[mx] + 1);
                else cnt += 1ll * str.query(1,1,n,a[i] + 1,mx);
            }
            mx = max(mx,a[i]);
            ++b[a[i]];
            str.modify(1,1,n,a[i]);
            printf("%lld",cnt);
            if(i < n) putchar(' ');
        }   
        puts("");
    }
    return 0;
}