#include<bits/stdc++.h>
#define ll long long
#define lowbit(x) (x&(-x))
using namespace std;

const int N = 1e6 + 10;
int a[N], n, s[N];
ll f[N];
bool st[N];
void add(int x, int t) {

    while (x <= n) {
        s[x] += t;
        x += lowbit(x);
    }
}

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

void solve()
{
    cin >> n;
    vector<int>v(1, 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i], f[i] = st[i] = s[i] = 0;
    }
    ll res = 0, t = 0;
    bool ok = 0;
    add(a[1], 1), st[a[1]] = 1;
    for (int i = 2; i <= n; i++) {
        if (a[i] > a[v.back()]) {
            res += 2 + t ;
            f[i] = res;
            v.push_back(i);
            t = 0, ok = 0;
        }
        else {
            res += query(n) - query(a[i]);
            //cout << i << ' ' << query(n)  << "#\n";
            f[i] = res;
            if (a[i] == a[v.back()])ok = 1;
        }
        if (!st[a[i]])add(a[i], 1), st[a[i]] = 1;
        if (ok)t++;
    }
    for (int i = 1; i <= n; i++) {
        cout << f[i];
        if (i < n)cout << ' ';
    }
    cout << '\n';
}
int main()
{
    srand(time(0));
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t; cin >> t;
    while (t--)solve();
    return 0;
}