#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define PII pair<int, int>
const int N = 1e5 + 5;
const int M = 1e5 + 5;
const int INF = 1e18 + 10;

int n;
int tr[N];

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

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

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

void solve()
{
    cin >> n;
    vector<int> a(n + 1);
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        tr[i] = 0;
    }

    int mx = a[1];
    cout << 0;
    if (n != 1)
        cout << " ";
    int ans = 0;

    vector<bool> st(n + 1);
    st[a[1]] = true;
    add(a[1], 1);

    int cnt = 0;
    int sum = 0;
    for (int i = 2; i <= n; i++)
    {
        if (a[i] > mx)
        {
            ans++;
            ans += sum + 1;

            sum = 0;
            cnt = 0;
        }
        else
        {
            int res = ask(n) - ask(a[i]);
            ans += res;

            if (a[i] == mx)
            {
                sum++;
                cnt++;
            }
            else
            {
                if (cnt)
                {
                    sum += cnt;
                }
            }
        }

        mx = max(mx, a[i]);
        if (!st[a[i]])
        {
            st[a[i]] = true;
            add(a[i], 1);
        }
        cout << ans;
        if (i != n)
            cout << " ";
    }
    cout << endl;
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }

    return 0;
}

/*
1
20
8 11 11 2 14 15 14 10 9 16 3 14 19 10 20 10 7 19 11 15

1
20
6 10 19 10 18 15 14 7 6 10 5 2 8 20 12 4 4 12 5 15
*/