#include <bits/stdc++.h>
#define endl '\n'
#define int long long
using namespace std;

const int maxn = 1e5 + 10;
int n, a[maxn], cnt1[maxn], cnt2[maxn], c[maxn];

inline int lowbit(int x) {
    return x & -x;
}

void add(int x, int k) {
    while ( x <= n ) {
        c[x] += k;
        x += lowbit(x);
    }
}

int query(int x) {
    int res = 0;
    while ( x > 0 ) {
        res += c[x];
        x -= lowbit(x);
    }
    return res;
}

void solve() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        c[i] = 0;
    }
    int cnt = 0;
    for (int i = 1; i <= n; i++) {
        if ( a[1] < a[i] ) {
            swap(a[1], a[i]);
            cnt++;
        }
        cnt1[i] = cnt;
    }
    for (int i = 1; i <= n; i++) {
        cnt2[i] = cnt2[i - 1] + query(n) - query(a[i]);
        if ( query( a[i] ) - query( a[i] - 1 ) == 0 ) add(a[i], 1);
    }
    for (int i = 1; i <= n; i++) {
        if ( i != 1 ) cout << ' ';
        cout << cnt1[i] + cnt2[i];
    }
    cout << endl;
}

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