#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;

int n, s[N], hv[N];

int query(int x)
{
    int res = 0;
    for (; x; x -= x & -x) {
        res += s[x];
    }
    return res;
}

void modify(int x)
{
    for (; x <= n; x += x & -x) {
        ++s[x];
    }
    return;
}

signed main()
{
    int T;
    scanf("%d", &T);
    while (T--) {
        scanf("%d", &n);
        for (int i = 1; i <= n; ++i) {
            s[i] = hv[i] = 0;
        }
        long long z = 0;
        for (int i = 1, x, mx = 0, ct = -1; i <= n; ++i) {
            scanf("%d", &x);
            if (x > mx) {
                mx = x;
                ++ct;
            }
            printf("%lld%c", (z += i - 1 - query(x)) + (ct << 1), " \n"[i == n]);
            modify((hv[x]++ ? 1 : x));
        }
    }
    return 0;
}