#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
#define lowbit(_) _ & (-_)
#define endl '\n'
#define PII pair<ll, ll>
const ll N = 1e6 + 5;
const ll M = 1e5 + 5;

vector<int> arr;

int n;
int seg[N];

void add(int index)
{
    while (index <= n)
    {
        seg[index]++;
        index += lowbit(index);
    }
}

int search(int index)
{
    int s = 0;
    while (index)
    {
        s += seg[index];
        index -= lowbit(index);
    }
    return s;
}

void solve()
{
    int mx = 0;
    int tot = 0; // 最大值出现的次数
    int longest = 0;
    int res = 0;
    int div = 0; // 有多少个不同的值
    bool big = 0;
    int lag = 0;

    cin >> n;

    int u;
    cin >> u;
    mx = u;
    tot = 1;
    cout << 0;
    if (n != 1)
        cout << ' ';
    arr.clear();
    for (int i = 1; i <= n; i++)
        seg[i] = 0;

    for (int i = 2; i <= n; i++)
    {
        cin >> u;
        if (u < mx)
        {
            arr.push_back(u);
            if (big)
                lag++;
        }
        else if (u > mx)
        {
            lag = 0, big = 0;
            arr.push_back(mx);
            mx = u;
            tot = 1;
            longest++;
        }
        else
        {
            big = 1;
            arr.push_back(mx);
            tot++;
        }

        if (search(arr.back()) - search(arr.back() - 1) == 0)
        {
            div++;
            add(arr.back());
        }

        int ans = div - search(arr.back());
        res += ans;
        cout << res + longest + i - 1 - (tot - 1)-lag;
        if (i != n)
            cout << ' ';
    }
    cout << '\n';
}

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

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

    return 0;
}