#include <bits/stdc++.h>
#define int long long
using namespace std;

const int N = 1e5 + 5;
int n, a[N];
bool vis[N];

class BIT{
    private:
        int n, f[N];
        int lowbit(int i)
        {
            return i & -i;
        }
    public:
        void init(int n)
        {
            this->n = n;
            for(int i = 1;i <= n;++i) f[i] = 0;
        }
        void add(int x, int i)
        {
            for(;x <= n;x += lowbit(x)) f[x] += i;
        }
        int get(int x)
        {
            int res = 0;
            for(;x;x -= lowbit(x)) res += f[x];
            return res;
        }
} bit;

void solve()
{
    cin >> n;
    for(int i = 1;i <= n;++i) cin >> a[i];
    bit.init(n);
    for(int i = 1;i <= n;++i) vis[i] = 0;
    int ans = 0, maxv = a[1], cur = 1, suc = 0;
    bit.add(a[1], 1);
    vis[a[1]] = 1;
    cout << ans;
    for(int i = 2;i <= n;++i)
    {
        if(a[i] > maxv)
        {
            ans += 2;
            if(suc) ans += i - suc;
            suc = 0;
            bit.add(a[i], 1);
            vis[a[i]] = 1;
            ++cur;
            maxv = a[i];
        }
        else
        {
            ans += cur - bit.get(a[i]);
            if(!vis[a[i]]) bit.add(a[i], 1), vis[a[i]] = 1, ++cur;
            if(a[i] == maxv && !suc) suc = i;
        }
        cout << ' ' << ans;
    }
    cout << '\n';
}

signed main()
{
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
    cin >> t;
    while(t--) solve();
    return 0;
}