#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define fo(i,a,b) for(ll (i)=(a);(i)<=(b);(i)++)
#define fd(i,a,b) for(ll (i)=(a);(i)>=(b);(i)--)

using namespace std;
const int N=2e5+10;
int a[N],b[N];;
ll SORT(int n){
	ll ans=0;
	fo(i,1,n) b[i]=a[i];
	fo(i,1,n)
	{
		fo(j,1,n)
			if(b[i]<b[j]) 
				swap(b[i],b[j]),ans++;
	}		 
	
	return ans;
}
int n;
void solve()
{
	cin>>n;
	fo(i,1,n) {
		cin>>a[i];
		cout<<SORT(i)<<" ";
	}
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	int T=1;
	cin>>T;
	while(T--) solve();
	return 0;
} 
/*
2
13 
1 5  9 8 45 6 8 7 2 2 1 1 35 

9 
1 5  9 8 45 6 8 7 2 
*/