#include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
void print() { cout << '\n'; }
template <typename T, typename...Args>
void print(T t, Args...args) { cout << t << ' '; print(args...); }
using ll = long long;
const int N = 200010;

int dir[4][2] = {
    {1, 0}, {0, 1}, {-1, 0}, {0, -1}
};

template <typename T> bool chmax(T &x, T y) { if (y > x) { x = y; return true; } return false; }
template <typename T> bool chmin(T &x, T y) { if (y < x) { x = y; return true; } return false; }

template <typename T = int>
vector<T> readVector(int n) {
    vector<T> a(n);
    for(T &x: a) cin >> x;
    return a;
} 

struct Fenwick {
    vector<ll> tr;
    int n;
    
    Fenwick (int n): n(n), tr(n + 1) {}
    
    void modify (int x, int v) {
        for (int i = x; i <= n; i += i & -i) {
            tr[i] += v;
        }
    }
    
    ll sum (int x) {
        ll res = 0;
        for (int i = x; i; i -= i & -i) {
            res += tr[i];
        }
        return res;
    }
    
    ll query (int l, int r) {
        return sum(r) - sum(l - 1);
    }
};

void solve () {
    int n;
    cin >> n;
    
    Fenwick fen(n);
    
    ll ans = 0;
    vector<int> a(n + 1);
    vector<set<int>> pos(n + 1);
    for (int i = 1; i <= n; i ++) {
        cin >> a[i];
        pos[a[i]].insert(i);
        if (fen.query(a[i], a[i]) == 0) {
            fen.modify(a[i], 1);
        }
        if (a[1] < a[i]) {
            ans ++;
            if (pos[a[1]].size() >= 2) {
                ans += i - *next(pos[a[1]].begin());
            }
            pos[a[1]].erase(1);
            pos[a[1]].insert(i);
            pos[a[i]].erase(i);
            pos[a[i]].insert(1);
            swap(a[1], a[i]);
        } 
        ans += fen.query(a[i] + 1, n);
        cout << ans << " \n"[i == n];
    }
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	int t = 1; 
	cin >> t;
	while(t --) {
	    solve();
	}

	return 0;
}