#include <bits/stdc++.h>

using namespace std;

#define lowbit(x) x & -x
#define i32 int 
#define i64 long long 
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define endl '\n'
const int N = 1e5 + 10;
int a[N], aa[N];
int n;
int t[N];
int ans[N];


struct BIT{
	int n;
	int t[100001];
	void clear(){ for(int i = 0; i <= n; ++i) t[i] = 0; }
	int sum(int k){ int sum = 0;
		while (k) {sum += t[k], k -= lowbit(k); } return sum;
	}
	
	int sum(int l,int r){
		return sum(r) - sum(l - 1);
	}
	
	void change(int k, int x){
		for (int i = k; i <= n; i += lowbit(i)) t[i] += x;
	}
	
};
BIT b;

int get(int o){
	
	int cnt = 0;
	for (int i = 1; i <= o; i ++) aa[i] = a[i];
	for (int i = 1; i <= o; i ++){
		if (aa[i] > aa[1]){
			swap(aa[i], aa[1]);
			cnt ++;
		}
	}
	b.change(aa[1], 1);
	int maxv = aa[1];
	for (int i = 2; i <= o; i ++){

		
		int t = b.sum(aa[i] + 1, maxv);
		cnt = cnt + t;
		int c = b.sum(aa[i], aa[i]);
		if (!c) b.change(aa[i], 1);
	}
	
	for (int i = 1; i <= n; i ++) b.t[i] = 0;
	return cnt;
	
}


void solve(){
	cin >> n;
	for (int i = 1; i <= n; i ++) cin >> a[i];
	ans[1] = 0;
	b.n = n;
	b.clear();
	cout << "0";
	for (int i = 2; i <= n; i ++){
		cout << ' ' << get(i);
	}
	
	cout << endl;
	
}

int main(){
	IOS;
	i32 t = 1;
	cin >> t;
	while (t --) solve();
	
}