#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = 1e5 + 10;

int BIT[2 * N];

int ask(int x)
{
    int ret = 0;
    for (; x; x -= x & -x)
        ret += BIT[x];
    return ret;
}

void add(int n, int x, int y)
{
    for (; x <= n; x += x & -x)
        BIT[x] += y;
}

int main()
{
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t, n, a, maxa;
    ll ans;
    cin >> t;
    while (t--)
    {
        cin >> n;
        for (int i = 0; i <= n; i++)
            BIT[i] = 0;
        ans = 0;
        cin >> a;
        maxa = a;
        add(n, a, 1);
        cout << ans;
        if (n > 1)
            cout << " ";
        for (int i = 2; i <= n; i++)
        {
            cin >> a;
            if (ask(a) - ask(a - 1) == 0)
                add(n, a, 1);
            if (a > maxa)
            {
                swap(a, maxa);
                ans++;
                assert(ask(n) - ask(a) == 1);
            }
            ans += ask(n) - ask(a);
            cout << ans;
            if (i < n)
                cout << " ";
        }
        cout << endl;
    }
    return 0;
}