#include<bits/stdc++.h>
using namespace std;

#define ll int
const ll N=2e5+5;
ll a[N],stk[N];
ll v,n,ans,top;
void solve()
{
    cin>>n;
    ans=0,top=0;
    for(ll i=1;i<=n;i++)
    {
        cin>>a[i];v=a[i];
        if(!top) stk[++top]=i;
        else
        {
            while(top>1&&a[stk[top-1]]<=v) ans+=stk[top]-stk[top-1],top--;
            if(a[stk[top]]<v) ans+=i-stk[--top]-1;
            else if(a[stk[top]]==v) top--;
            stk[++top]=i;   
        }
    }
    while(top>1) ans+=stk[top]-stk[top-1],top--;
    cout<<ans<<endl;   
}

int main()
{
    ll t; cin>>t; while(t--)
    solve();
    return 0;
}