#include<bits/stdc++.h>
#define ll long long
int read()
{
	int x=0; bool f=0; char ch=getchar();
	while(! isdigit(ch)) f|=(ch == '-'),ch=getchar();
	while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
	return f ? -x : x;
}
using namespace std;
const int N=2e5+10;
int n,L[N],R[N]; ll res;
pair<int,int> a[N]; 

set<int> pl;
struct cp
{
	bool operator () (int a,int b) {
		return a > b;
	}
} ;
set<int,cp> yl;

bool cmp(pair<int,int> a,pair<int,int> b)
{
	if(a.first != b.first) return a.first > b.first;
	return a.second > b.second;
}
bool cmp1(pair<int,int> a,pair<int,int> b)
{
	if(a.first != b.first) return a.first > b.first;
	return a.second < b.second;
}
int main()
{
	int t=read();
	while(t -- )
	{
		res=0;
		
		yl.clear(); pl.clear(); n=read();
		for(int i=1;i<=n;i++) a[i].first=read(),a[i].second=i;
		
		sort(a+1,a+1+n,cmp);
		R[a[1].second]=n; pl.insert(a[1].second);
		for(int i=2;i<=n;i++)
		{
			auto tmp=upper_bound(pl.begin(),pl.end(),a[i].second);
			if(tmp == pl.end()) R[a[i].second]=n;
			else R[a[i].second]=(*tmp)-1;
			
			pl.insert(a[i].second);
		}
		
		sort(a+1,a+1+n,cmp1); 
		L[a[1].second]=1; yl.insert(a[1].second);
		for(int i=2;i<=n;i++)
		{
			auto tmp=upper_bound(yl.begin(),yl.end(),a[i].second,greater<int>());
			if(tmp == yl.end()) L[a[i].second]=1;
			else L[a[i].second]=(*tmp)+1;
			
			yl.insert(a[i].second);
		}
		
		for(int i=1;i<=n;i++) res+=(R[i]-L[i]);
		printf("%lld\n",res);
	}
	return 0;
}