#include <bits/stdc++.h>
#define endl "\n"
#define int long long
#define PII std::pair<int, int>
#define PSS std::pair<string, string>
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define inf 0x3f3f3f3f
//#define lc p<<1
//#define rc p<<1|1
#define pi acos(-1)
#define PIS pair<int,string>
using namespace std;

int n;
int v[110000],s[110000],vis[110000];
void add(int x)
{
	while(x<=n)
	{
		s[x]+=1;	
//		cout<<s[x]<<"********"<<x<<endl;
		x+=(x&-x);
	
	}
}
int sum(int x)
{
	int res=0;
	while(x)
	{
		res+=s[x];
		x-=(x&-x);
	}
	return res;
}
void solve()
{
	cin>>n;
	memset(vis,0,sizeof(vis));
	memset(s,0,sizeof(s));
	memset(v,0,sizeof(v));
	for(int i=1;i<=n;i++) cin>>v[i];
	int ans=0;
	cout<<ans;
	add(v[1]);vis[v[1]]=1;
//	cout<<s[1]<<endl;
	int flag=0,cnt=0;
	for(int i=2;i<=n;i++)
	{
		
		if(!vis[v[i]]) vis[v[i]]=1,add(v[i]);
		if(v[i]==v[1]) flag=1;
		if(flag==1&&v[i]<=v[1])cnt++;
//		cout<<v[1]<<"****";
		if(v[i]>v[1]) {
			ans+=1+cnt,swap(v[i],v[1]);flag=0,cnt=0;}
//		cout<<sum(v[1])<<" "<<sum(v[i]);
		ans+=sum(v[1])-sum(v[i]);//第二大的数
		cout<<" "<<ans;
	}cout<<endl;
}
signed main() {
    IOS; cout.tie(0);
	int t=1;
    cin>>t;
	while(t--) solve();
	
}