#include<bits/stdc++.h>
#define ll long long
using namespace std;

const int N=1e5+5;
int n,c[N],a[N];
bool fl[N];

void add(int x) {
	for(;x;x-=x&-x) ++c[x];
}
int ask(int x) {
	int ret=0;
	for(;x<=n;x+=x&-x) ret+=c[x];
	return ret;
}

int main() {
//	freopen("1.in","r",stdin);
//	freopen("1.out","w",stdout);
	int T;scanf("%d",&T);
	while(T--) {
		scanf("%d",&n);
		for(int i=1;i<=n;++i) c[i]=fl[i]=0;
		for(int i=1;i<=n;++i) scanf("%d",&a[i]);
		int mx=a[1],num=1,sz=1;
		putchar('0'); 
		ll ans=0;
		for(int i=2;i<=n;++i) {
			if(!fl[a[i-1]]) {
				add(a[i-1]);
				fl[a[i-1]]=1;
			}
			if(mx<a[i]) {
				ans+=2; 
				if(sz>1) {
					ans+=i-1-num+1;
				}
				mx=a[i],num=i,sz=1;
			} else {
				ans+=ask(a[i]+1);
				if(mx==a[i]) {
					++sz;
					if(sz==2) num=i;
				}
			}
			printf(" %lld",ans);
		}
		puts("");
	}
	return 0;
}