#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>

void solu() {
    ll n;
    cin >> n;
    vector<pll> a(n); // first为index，second为value
    vector<ll> lindex(n, -1);
    vector<ll> rindex(n, -1);

    for (int i = 0; i < n; ++i) {
        cin >> a[i].second;
        a[i].first = i;
    }

    stack<pll> s;
    
    // 计算右边界
    for (ll i = 0; i < n; ++i) {
        while (!s.empty() && a[i].second > s.top().second) {
            rindex[s.top().first] = a[i].first;
            s.pop();
        }
        s.push(a[i]);
    }
    while (!s.empty()) {
        rindex[s.top().first] = -1;
        s.pop();
    }

    // 计算左边界
    for (ll i = n - 1; i >= 0; --i) {
        while (!s.empty() && a[i].second > s.top().second) {
            lindex[s.top().first] = a[i].first;
            s.pop();
        }
        s.push(a[i]);
    }
    while (!s.empty()) {
        lindex[s.top().first] = -1;
        s.pop();
    }

    ll ans = 0;
    for (ll i = 0; i < n; ++i) {
        ll left_dist = (lindex[i] == -1) ? i : i - lindex[i] - 1;
        ll right_dist = (rindex[i] == -1) ? n - i - 1 : rindex[i] - i - 1;
        ans += left_dist + right_dist;
    }

    cout << ans << endl;
}

int main() {
    ll q;
    cin >> q;
    while (q--) {
        solu();
    }
    return 0;
}