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

#define endl '\n'
#define rep(i, a, b) for(int i = (a); i <= (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
#define rept(i, a, ne) for(int i = (a); ~i ; i=ne[i])
#define debug(x) cout<<#x<<": "<<x<<endl
#define fi first
#define sec second
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
typedef long long LL;
typedef long double  LD;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef pair<int,int>PII;
const int N=1e5+10;
int a[N];
int b[N];
int c[N];
LL s[N];
bool bo[N];
void add(int x,int s)//不能0开始
{
    x++;
    for(;x<N;x+=x&-x)
        c[x]+=s;
}
int ask(int x)
{
    x++;
    int su=0;
    for(;x;x-=x&-x)
        su+=c[x];
    return su;
}

void slove()
{
    int n;
    cin>>n;
    rep(i,1,n)
    {
        cin>>a[i];
    }
    int mai=n;
    stack<PII>se;
    rep(i,1,n)
    {
        if(se.size()&&se.top().fi<a[i])
        {
            b[se.top().sec]=i;
            se.pop();
        }
        se.push({a[i],i});
    }

    rep(i,1,n)
    {

        if(i!=1&&ask(a[i]-1)==ask(N-1))
        {
            s[i]+=2;
        }
        else if(i!=1)
        {     
            if(ask(a[i])==ask(N-1))
            {
                if(b[i])
                s[b[i]]++;
            }
            else
            {
                s[i]+=ask(N-1)-ask(a[i]);
            }
        }
        if(bo[a[i]]==0)
        {
            bo[a[i]]=1;
            add(a[i],1);
        }
    }
    rep(i,1,n)
    {
        s[i]+=s[i-1];
        cout<<s[i]<<" \n"[n==i];
    }
    rep(i,1,n)
    {
        if(bo[a[i]])
        {
            bo[a[i]]=0;
            add(a[i],-1);
        }
        s[i]=b[i]=0;
    }
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
//	cout << fixed << setprecision(9);
    int t=1;
	cin>>t;
    while(t--)
    {
        slove();
    }


    return 0;
}
//#pragma GCC optimize(2)