#include <bits/stdc++.h>
using namespace std;
int n, a[500005], qwe;
vector<pair<int, int>> changes;
int t[500005], ans[500005];
inline int lowbit(int p) {
	return p & -p;
}
inline void change(int p, int q, int flg = 1) {
	if (flg) changes.push_back(make_pair(p, q));
	while (p <= n) {
		t[p] += q;
		p += lowbit(p);
	}
}
inline int query(int p) {
	int cnt = 0;
	while (p) {
		cnt += t[p];
		p -= lowbit(p);
	}
	return cnt;
}
inline void clear() {
	for (pair<int, int> op : changes) {
		change(op.first, -op.second, 0);
	}
	changes.clear();
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> qwe;
	while (qwe--) {
		clear();
		cin >> n;
		for (int i = 1; i <= n; i++) cin >> a[i];
		int lst = 0, num = -1, lsts = 0, aans = 0;
		for (int i = 1; i <= n; i++) {
			if (query(a[i] - 1) == query(n)) {
				aans += i - 1 - lst;
				lst = i, num++;
			}
			ans[i] = ans[i - 1] + query(n) - query(a[i]);
			if (query(a[i]) == query(a[i] - 1)) change(a[i], 1);
			cout << ans[i] + num + (lst - 1) - aans  ;
			if (i != n) cout << ' ';
			else cout << "\n";
		}
	}
}