#include<bits/stdc++.h> 
using namespace std;
#define fer(i,a,b) for(int i=a;i<=b;i++)
#define fdr(i,a,b) for(int i=a;i>=b;i--)
#define int long long
#define xx first
#define yy second
#define pb push_back
#define ps push
#define db double
#define P pair<int,int>
#define endl '\n'
#define ll long long
const int N=2e5+10;
const int mod=1e9+7;
priority_queue<int,vector<int>,greater<int>> pq;

int n;
int c[N];
int lowbit(int x){return x&(-x);}
int getsum(int x){int ans=0;while(x>0){ans+=c[x];x-=lowbit(x);}return ans;}
void add(int x,int k){while(x<=n){c[x]+=k;x+=lowbit(x);}}

int a[N];

void solve(){
	cin>>n;
	fer(i,1,n) cin>>a[i],c[i]=0;
	int ans=0;
	int mx=a[1];
	int pos=0;
	map<int,int> mp;
	fer(i,1,n){
		int preup=getsum(mx);
		int prelow=getsum(a[i]);
		int upnum=preup-prelow;
		if(a[i]>mx){
			if(mp[mx]>=2) ans+=i-pos;
			ans+=2;
			mx=a[i];
		}		
		else if(a[i]<=mx){
			ans+=upnum;
			if(a[i]==mx&&mp[mx]==1) pos=i;
		}
		mp[a[i]]++;
		if(mp[a[i]]==1) add(a[i],1);
		cout<<ans<<" \n"[i==n];
	}
}

signed main()
{
	ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);
	int t;
	cin>>t;
	while(t--){
		solve(); 
	} 
}