#include<bits/stdc++.h>
using namespace std;
const int MAX=1e5+5;
int sum[MAX*4];
int n,a[MAX],d[MAX];
bool flag[MAX];
long long ans1,ans2;
void modify(int k,int l,int r,int x){
	if(r<x||l>x)
		return;
	if(l==r&&l==x){
		if(!sum[k])
			sum[k]=1;
		return;
	}
	int mid=l+r>>1;
	modify(k<<1,l,mid,x);
	modify(k<<1|1,mid+1,r,x);
	sum[k]=sum[k<<1]+sum[k<<1|1];
}
int query(int k,int l,int r,int x,int y){
	if(y<l||x>r)
		return 0;
	if(l>=x&&r<=y)
		return sum[k];
	int mid=l+r>>1;
	int res=0;
	res=query(k<<1,l,mid,x,y);
	res+=query(k<<1|1,mid+1,r,x,y);
	return res;
}
// 快读 
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*10+c-'0';
		c = getchar();
	}
	return x*f;
}
void solve(){
	n=read();
	memset(sum,0,sizeof(int)*(n*4+1));
	memset(flag,0,sizeof(bool)*(n+1));
	memset(d,0,sizeof(int)*(n+1));
	for(int i=1;i<=n;++i)
		a[i]=read();
	ans1=0;
	ans2=-1;	
	flag[1]=1;
	int pre=1;
	for(int i=2;i<=n;++i){
		if(a[i]>a[pre]){
			flag[i]=1;
			pre=i;
		}
		else{
			if(a[i]==a[pre]){
				d[pre]=i;
			}
		}
	}
	int cur=1;
	for(int i=1;i<=n;++i){
		if(flag[i]){
			ans1++;
			ans2++;
			if(d[cur]){
				ans2+=i-1-d[cur]+1;
			}
			cur=i;
		}
		else{
			if(a[i]+1<=n){
				ans2+=query(1,1,n,a[i]+1,n);
			//	cout<<i<<" "<<query(1,1,n,a[i]+1,n)<<endl;
			}
				
		}
		modify(1,1,n,a[i]);
		if(i!=n)
			printf("%lld ",ans1+ans2);
		else
			printf("%lld\n",ans1+ans2);
	}
}
int main(){
	int T;
	cin>>T;
	while(T--){
		solve();
	}
}