#include<bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define For(i,j,k) for (int i=(j);i<=(k);i++)
#define rof(i,j,k) for (int i=(j);i>=(k);i--)
#define ull unsigned long long
#define lowbit(x) ((x)&(-(x)))
#define PII pair<int,int>
#define int long long
#define endl "\n"
#define ls rt<<1
#define rs rt<<1|1
typedef long long ll;
const int mod = 998244353;
const double eps = 1e-9;
const int N=2e6+7;
int n,m;
int a[N];
int q[N];
int a1[N];
void solve(){
    cin>>n;
    int ma=0;
    //离散化
    for(int i=1;i<=n;i++){
        cin>>a[i];
        a1[i]=a[i];
    }
    sort(a1+1,a1+n+1);
    int len1=unique(a1+1,a1+n+1)-a1-1;
    for(int i=1;i<=n;i++){
        a[i]=lower_bound(a1+1,a1+len1+1,a[i])-a1;
        ma=max(ma,a[i]);
    }
    int top=0;
    int ans=0;
    q[++top]=1;
    for(int i=2;i<=n;i++){
        while(top!=0&&a[q[top]]<a[i]){
            top--;
        }
        ans+=i-q[top]-1;
        q[++top]=i;
    }
    int cnt=0;
    for(int i=1;i<=n;i++){
        if(a[i]==ma) cnt=i;
    }
    //cout<<ans<<endl;
    top=0;
    q[++top]=1;
    for(int i=n-1;i>=cnt;i--){
        while(top!=0&&a[n-q[top]+1]<a[i]){
            top--;
        }
        ans+=n-i-q[top];
        q[++top]=n-i+1;
        //cout<<ans<<"!"; 
    }
    cout<<ans<<endl;
}
signed main(){
    fast;
    int t=1;
    cin>>t;
    while(t--){
        solve();
    }
}