#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int f[N], bit[N];
int n;
void add(int x) {
    for (int i = x; i <= n; i += (i & (-i)))
        bit[i]++;
};
int query(int x) {
    int res = 0;
    while (x > 0) {
        res += bit[x];
        x -= (x & (-x));
    }
    return res;
};
void solve() {
    cin >> n;
    for (int i = 0; i <= n; i++)
        f[i] = bit[i] = 0;
    long long cur = 0;
    int tot = 0, owe = 0, dx = 0;
    for (int i = 0, x; i < n; i++) {
        cin >> x;
        f[i] = x;
        if (query(x) == query(x - 1))
            add(x), ++tot;
        else if (dx == 0 && f[i] == f[0]) {
            dx = 1;
        }
        if (f[i] > f[0]) {
            swap(f[i], f[0]);
            ++cur;
            cur += owe;
            owe = 0;
            dx = 0;
        }
        owe += dx;
        cur += tot - query(f[i]);
        cout << cur;
        cout << (i != n - 1 ? ' ' : '\n');
    }
}
int main() {
    ios::sync_with_stdio(false);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}