#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;

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

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

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

signed main()
{
    int T;
    scanf("%d", &T);
    while (T--) {
        int z = 0, a1, t = 0;
        scanf("%d", &n);
        long long A = 0;
        for (int i = 1; i <= n; ++i) {
            vis[i] = s[i] = 0;
        }
        for (int i = 1, x; i <= n; ++i) {
            scanf("%d", &x);
            if (i == 1) {
                a1 = x;
            }
            if (!vis[x]) {
                modify(x);
                vis[x] = 1;
            }
            if (i > 1 && x == a1) {
                t = 1;
            } else if (x > a1) {
                A += z + 1;
                z = t = 0;
                swap(a1, x);
            }
            z += t;
            A += query(n) - query(x);
            printf("%lld%c", A, " \n"[i == n]);
        }
    }
    return 0;
}