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

#define ll long long
#define ull unsigned long long

int read()
{
    int x = 0; bool f = false; char c = getchar();
    while(c < '0' || c > '9') f |= (c == '-'), c = getchar();
    while(c >= '0' && c <= '9') x = (x << 1) + (x << 3) + (c & 15), c = getchar();
    return f ? -x : x;
}

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

struct BIT
{
	int c[N];
	BIT(){ memset(c, 0, sizeof(c)); }
	void add(int pos, int val)
	{
		while(pos <= n) c[pos] += val, pos += (pos & -pos);
	}
	int query(int pos)
	{
		int ans = 0;
		while(pos) ans += c[pos], pos -= (pos & -pos);
		return ans;
	}
}T1;

void solve()
{
	n = read();
	for(int i = 1; i <= n; ++i) a[i] = read();
	for(int i = 0; i <= n; ++i) T1.c[i] = 0, vis[i] = 0;
	ll ans = 0, sum = 0, mx = a[1];
	T1.add(a[1], 1), vis[a[1]] = 1;
    printf("0");

    // for(int i = 1; i <= 11; ++i)
    // {
    //     for(int j = 1; j <= 11; ++j)
    //         if(a[i] < a[j])
    //         {
    //             swap(a[i], a[j]);
    //             for(int k = 1; k <= 11; ++k) printf("%d ", a[k]);
    //             printf("\n");
    //         }
    // }

    int fi = 1, se = 2;

	for(int i = 2; i <= n; ++i)
	{
		if(a[i] > mx) sum = sum + 2 + i - se, ans += sum, fi = i, se = i + 1;
		else sum = sum + T1.query(n) - T1.query(a[i]), ans += sum;
        if(a[i] != mx && se == i) se = i + 1;
        printf(" %lld", sum);
        if(vis[a[i]] == 0) T1.add(a[i], 1), vis[a[i]] = 1;
        mx = max(mx, 1ll * a[i]);
	}
    printf("\n");
}

int main()
{
	int T = read();
	while(T--) solve();
    return 0;
}