#include <bits/stdc++.h>

//DEBUG:    https://github.com/sharkdp/dbg-macro
#ifdef LOCAL
#include "../Lib/dbg-macro-0.5.1/dbg.h"
#else
#define dbg(...) (__VA_ARGS__)
#endif

#define endl '\n'
using namespace std;
typedef long long ll;
typedef long double llf;
const ll MAXN=2e5+10,MOD=998244353,INF=1e9;

ll qpow(ll base,ll exp){ll ans=1;while(exp){if(exp&1)(ans*=base)%=MOD;(base*=base)%=MOD;exp>>=1;}return ans;}
template<class T>ll max_binary_answer(ll l,ll r,T check,bool cmp=true){ll m;while(l<r){m=(l+r+1)/2;if(cmp^!check(m))l=m;else r=m-1;}return l;}
template<class T>ll min_binary_answer(ll l,ll r,T check,bool cmp=true){ll m;while(l<r){m=(l+r)/2;if(cmp^!check(m))r=m;else l=m+1;}return r;}
ll exgcd(ll a,ll b,ll &x,ll &y){ll tmp;return b==0?(x=1,y=0,a):(tmp=exgcd(b,a%b,y,x),y-=(a/b)*x,tmp);}
ll highbit(ll x){for(ll i=1;i<(ll)sizeof(ll)*4;i<<=1)x|=x>>i;return x-(x>>1);}
ll lowbit(ll x){return x&(-x);}
//--------Global declared area--------
ll n, c[2][MAXN];
void print(vector<int> &a){
	for(auto i:a){
		cout<<i<<' ';
	}cout<<endl;
}
int lowbit(int x)
{
	return x&(-x);
}
void add(int g,int pos,int x)
{
	for(;pos<=n;pos+=lowbit(pos)) c[g][pos] += x;
}
ll sum(int g, int pos)
{
	ll res = 0;
	for(;pos;pos-=lowbit(pos)) res += c[g][pos];
	return res;
}
//--------Global declared end --------
void solve(int test_num){
	cin>>n;
	vector <int> a(n+5);
	for(int i=1;i<=n;i++){
		cin>>a[i];
		c[0][i] = c[1][i] = 0;
	}
	vector <int> cnt(n+5);
	for(int i=1;i<=n;i++)
	{
		cnt[i] = sum(0,n)-sum(0,a[i]);
		if(!(sum(0,a[i])-sum(0,a[i]-1))) add(0,a[i],1);
//		cout<<cnt[i]<<" \n"[i==n];
	}
	ll s = 0, b = 0;
	for(int i=1;i<=n;i++)
	{
		if(a[i]>a[1])
		{
			cnt[i] ++;
			b ++;
		}
		s += cnt[i];
		cout<<s+b<<' ';
	}
	cout<<'\n';
}

int main(){
#ifdef ACM
	freopen("D:/Code/C or C++/File/input.txt","r",stdin);
	freopen("D:/Code/C or C++/File/output.txt","w",stdout);
	freopen("D:/Code/C or C++/File/error.txt","w",stderr);
#else
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr),std::cout.tie(nullptr);
#endif
	int t=1;
	cin>>t;
	for(int i=1;i<=t;i++){
		solve(i);
		//cout.flush();
	}
	return 0;
}