#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[250000]={0};
void solve(){
	ll n;
	scanf("%d",&n);
	stack<ll>down;
	ll maxi=-1;
	for(ll i=1;i<=n;i++){
		scanf("%d",&i[a]);
		maxi=max(maxi,a[i]);
	}
	ll ans=0;
	a[n+1]=maxi;
	for(ll i=1;i<=n+1;i++){
		if(down.empty()||a[down.top()]>=a[i]){
			down.push(i);
		}else{
			stack<ll>calc;
			ll tmp;
			while(!down.empty()&&a[down.top()]<a[i]){
				while(!calc.empty()&&a[calc.top()]==a[down.top()]){
					calc.pop();
				}
				calc.push(down.top());
				down.pop();
			}
			tmp=-1;
			while(!calc.empty()){
				ans+=i-calc.top();
				tmp=(tmp==-1?calc.top():tmp*1);
				calc.pop();
			}
			down.push(tmp);
			a[tmp]=a[i];
			down.push(i);
		}
	}
	printf("%d",ans);
	return ;
}

int main(){
	ll t;
	scanf("%d",&t);
	while(t--){
		solve();
		if(t) printf("\n");
	}
	
	
	return 0;
}