#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")

#include<bits/stdc++.h>
#define int long long
#define double long double
#define pii pair<int, int>
#define pdd pair<double, double>
#define lowbit(x) (x & -x)
#define all(x) x.begin(), x.end()

#define rep(i, x, y) for(int i = x; i <= y; ++i)
#define per(i, x, y) for(int i = x; i >= y; --i)
 
using namespace std;
using i32 = int32_t;
using i64 = int64_t;
using i128 = __int128_t;

constexpr i32 N = 1e3 + 10; 
constexpr i32 inf = 2e9; 
constexpr i64 INF = 1e18; 
constexpr i64 mod = 1e9 + 7; 
constexpr int dx[] = {-1, 1, 0, 0};
constexpr int dy[] = {0, 0, -1, 1};

inline int iceil(int a, int b) { return (a + b - 1) / b;}
int qpow(int a, int b) { int ans = 1; while(b) { if(b&1) ans *= a; b >>= 1; a *= a;} return ans;}

template <class T> class fenwick{
private: int n; vector<T> tree;
public:
    fenwick(int _n = 0):n(_n + 1), tree(_n + 1, 0) {}
    void add(int i, T d){
        for( ; i < n; i += (i&-i)) tree[i] += d;
    }
    T ask(int i){
        T sum = 0;
        for( ; i; i -= (i&-i)) sum += tree[i];
        return sum;
    }
    T ask(int l, int r){
        return ask(r) - ask(l-1);
    }
    int kth(T k) {
        int x = 0;
        for (int i = 1 << __lg(n); i; i >>= 1) {
            if (x + i <= n && k >= tree[x + i - 1]) {
                x += i;
                k -= tree[x - 1];
            }
        }
        return x;
    }
};

void solve() {
    int n; cin >> n;
    vector<int> a(n+2);
    vector<int> b(n+2);
    vector<int> c(n+2);
    int maxn = 0;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        maxn = max(maxn, a[i]);
        b[i] = maxn;
    }
    maxn = 0;
    for(int i = n; i >= 1; i--) {
        maxn = max(maxn, a[i]);
        c[i] = maxn;
    }
    int ans = 0;
    for(int i = 1; i <= n; i++) {
        if(a[i] > b[i-1]) {
            ans += max(i - 1, 0LL);
        }
        if(a[i] > c[i+1]) {
            ans += max(n - i, 0LL);
        }
    }
    cout << ans << '\n';
}
 
int32_t main() {
    std::ios::sync_with_stdio(false), std::cin.tie(NULL);
 
    i32 T = 1;  std::cin >> T;
    while(T--) solve();
    return 0;
}