#include<bits/stdc++.h>
#define INF 1e16
#define endl '\n'
#define PI acos(-1)
#define pb push_back
#define int long long
#define mem(x,v) memset(x,v,sizeof x)
using namespace std;
const int N = 3e5+5;
const int K = 25;

int T,n,ans;
int a[N],mx[N][K],mn[N][K];

inline void RMQ_init(){
	for(register int j=1;j<=20;j++)for(register int i=1;i+(1<<j)-1<=n;i++){
		mx[i][j]=max(mx[i][j-1],mx[i+(1<<(j-1))][j-1]);
		mn[i][j]=min(mn[i][j-1],mn[i+(1<<(j-1))][j-1]);
	}
}
inline int QueryMax(int l,int r){
	int k=log2(r-l+1);
	return max(mx[l][k],mx[r-(1<<k)+1][k]);
}
inline int QueryMin(int l,int r){
	int k=log2(r-l+1);
	return min(mn[l][k],mn[r-(1<<k)+1][k]);
}
void solve(){
	cin>>n,ans=0;
	for(register int i=1;i<=n;i++)cin>>a[i],mx[i][0]=mn[i][0]=a[i];
	RMQ_init();
	for(register int i=1;i<=n;i++)ans+=(i-1)*(n-i+1);
	for(register int i=1;i<=n;i++){
		int l,r,Nmin,Pmin,Pmax;
		l=i+1,r=n,Nmin=n+1;
		while(l<=r){
			int mid=l+r>>1;
			if(QueryMin(i+1,mid)<a[i])r=mid-1,Nmin=mid;
			else l=mid+1;
		}
		l=1,r=i-1,Pmin=0;
		while(l<=r){
			int mid=l+r>>1;
			if(QueryMin(mid,i-1)<a[i])l=mid+1,Pmin=mid;
			else r=mid-1;
		}
		l=1,r=Pmin-1,Pmax=0;
		while(l<=r){
			int mid=l+r>>1;
			if(QueryMax(mid,Pmin-1)>a[i])l=mid+1,Pmax=mid;
			else r=mid-1;
		}
		ans-=(Nmin-i)*(Pmin-Pmax);
	}
	cout<<ans<<endl;
	for(register int j=1;j<=20;j++)for(register int i=1;i+(1<<j)-1<=n;i++)mx[i][j]=mn[i][j]=0;
}
signed main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	for(cin>>T;T--;)solve();
	return 0;
}