#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 10;

int BIT[N];

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

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

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