#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
// #define int long long
template <typename T> class fenwick
{
    vector<T> a;
    int n;

  public:
    fenwick(int x) : a(x + 1)
    {
        n = x;
    }
    fenwick(vector<T> &t) : a(t)
    {
        n = t.size() - 1;
        init();
    }
    fenwick(vector<T> &t, int x) : a(t)
    {
        n = x;
        init();
    }
    int lowbit(int x)
    {
        return x & -x;
    }
    void add(int x, T k)
    {
        while (x <= n)
        {
            a[x] += k;
            x = x + lowbit(x);
        }
    }
    void change(int x, T k)
    {
        T temp = sum(x) - sum(x - 1);
        add(x, k - temp);
    }
    T sum(int x)
    {
        int ans = 0;
        while (x > 0)
        {
            ans = ans + a[x];
            x -= lowbit(x);
        }
        return ans;
    }
    int get(int l, int r)
    {
        if (l > r)
        {
            return 0;
        }

        return sum(r) - sum(l - 1);
    }
    void init()
    {
        for (int i = 1; i <= n; ++i)
        {
            int j = i + lowbit(i);
            if (j <= n)
                a[j] += a[i];
        }
    }
};
int solve()
{
    int n;
    cin >> n;
    vector<int> a(n);
    vector<int> pos(n + 1);
    for (auto &i : a)
    {
        cin >> i;
    }
    int ans = -2;
    fenwick<int> t(n);
    int maxx = 0;

    for (int i = 0; i < n; i++)
    {
        if (a[i] > maxx)
        {
            ans += max(0, (i - (pos[maxx] ? pos[maxx] : 998244353))) + 2;
        }
        else if (a[i] <= maxx)
        {
            ans += t.get(a[i] + 1, n);
        }
        if (t.get(a[i], a[i]) && pos[a[i]] == 0)
        {
            pos[a[i]] = i;
        }
        t.change(a[i], 1);
        cout << ans << " \n"[i == n - 1];
        maxx = max(maxx, a[i]);
    }

    return 0;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int test = 1;
    cin >> test;
    while (test--)
    {
        solve();
    }

    return 0;
}