#include<bits/stdc++.h>
#define maxn 1000000001
#define ll long long
using namespace std;
void slove(){
vector<ll> num,st;
	ll n,a,ans=0,sum;
	scanf("%lld",&n);
	for(ll i=1;i<=n+1;i++){
		if(i!=n+1) scanf("%lld",&a);
		else a=maxn;
		sum=1;
		if(st.empty()){
			st.push_back(a);
			num.push_back(1);
			continue;
		}
		while(1){
		    if(a==st.back()){ 
			    num.back()+=sum;
			    break;
			}
		    else if(a<st.back()){
			    st.push_back(a);
				num.push_back(sum);
				break;
			}
		    else {
			    if(st.size()==1){
			        st.back()=a;
			        ans+=num.back();
			        num.back()+=sum;
//			        printf("%d\n",num.back());
			        break;
			    }
			    else if(a>*(st.end()-1)){
			        ans+=num.back();
			        *(num.end()-1)+=num.back();
			        num.pop_back();
			        st.pop_back();
			    }
			    else if(a<=*(st.end()-1)){
			        ans+=num.back();
			        sum+=num.back();
			        num.pop_back();
			        st.pop_back();
				}
		    }
			
		}
//		printf("%d %d %d %d\n",i,ans,st.back(),num.back());
	}
	printf("%lld\n",ans-n);
	return ;
}
int main(){
	int T;
	scanf("%d",&T);
	while(T--) slove();
	return 0;
}
/*
4
2
1 2
2
2 2
7
1 1 1 2 2 2 2
3
1 2 3
*/