#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;


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;
bool vis[N];

void solve(){
	cin >> n;
	for (int i = 1; i <= n; i ++) cin >> a[i];
	memset(vis, 0, sizeof vis);
	b.n = n;
	b.clear();
	cout << "0";
	int cnt = 0;
	bool f = false;
	
	int res = 0;
	b.change(a[1], 1); vis[a[1]] = 1;
	for (int i = 2; i <= n; i ++){
		if (!vis[a[i]]) vis[a[i]] = 1, b.change(a[i], 1);
		if (a[i] == a[1]) f = true;
		if (a[i] > a[1]) res += 1 + cnt, swap(a[1], a[i]), cnt = f = 0;
		res += b.sum(a[i] + 1, a[1]);
		cout << " " << res;		
	}
	cout << endl;
	
}

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