#include <bits/stdc++.h>
using namespace std;
int t,n,a[200005],ans,cnt[200005],maxx,dp[200005];
int k[200005],k1;

int main (){
	cin>>t;
	while(t--){
		ans=0;
		cin>>n;
		memset(cnt,0,sizeof(cnt));
		memset(dp,0,sizeof(dp));
		memset(k,0,sizeof(k));
		for (int i=1;i<=n;i++) cin>>a[i];
		for(int i=n;i>=1;i--){
			for(int j=i-1;j>=1;j--){
				if(a[i]>a[j])cnt[i]++;
				else break;
			}
		}
		for(int i=1;i<=n;i++){
			if(cnt[i]==i-1)k[i]=0;
			else k[i]=k[i-cnt[i]-1]+1;
			cout<<k[i]<<endl;
		}
		maxx=0;
		for(int i=1;i<=n;i++){
			if(a[i]>maxx){
				maxx=a[i];dp[i]=dp[i-1]+i-1;continue;
			}
			else if(a[i]==maxx){
				dp[i]=dp[i-1];
			}
			else{
				dp[i]=dp[i-1]+cnt[i]+k[i];
			}
			
		}
		cout<<dp[n]<<endl;
	}
}