#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
void solve() {
    int n; cin >> n;
    vector<int>a(n+1);

    for(int i = 1 ; i <= n ; i++) {
        cin >> a[i];
    }

    ll ans = 0;

    vector<int>stk;
    for(int i = 1 ; i <= n ; i++){
        while(!stk.empty() && a[stk.back()] < a[i]) stk.pop_back();
        if(!stk.empty()) ans += i-stk.back()-1;
        else ans += i-1;
        stk.push_back(i);
    }
    vector<int>stk2;
    for(int i = n ; i >= 1 ; i--){
        while(!stk.empty() && a[stk.back()] < a[i]) stk.pop_back();
        if(!stk.empty() && a[i]!=a[stk.back()]) ans += stk.back()-i-1;
        else if(stk.empty())ans += i-1;
        stk.push_back(i);
    }
    cout<<ans<<endl;
}

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