#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

using ll = long long;
using ull = unsigned long long;
using ld = long double;

template<class __set_element_type>
using gnu_set= tree<__set_element_type, null_type,less<__set_element_type>, rb_tree_tag,tree_order_statistics_node_update>;
template<class __key_type, class __val_type>
using gnu_map = tree<__key_type, __val_type,less<__key_type>, rb_tree_tag,tree_order_statistics_node_update>;

#define ios ios::sync_with_stdio(0); cin.tie(0)

const ll oo = 1e18;
const ll MOD = 1e9 + 7;

int t, n;

void solve() {
    cin >> n;
    vector<int> perm(n), loc(n);
    for(auto &p: perm)
        cin >> p;
    for(int i = 0; i < n; i++) 
        loc[perm[i]] = i;
    
    ll sum = n;
    ll l = loc[0], r = loc[0];
    for(ll i = 1; i < n; i++) {
        if(l <= loc[i] && loc[i] <= r)
            continue;
        ll le = (loc[i] < l ? loc[i]+1 : 0), re = (loc[i] > r ? loc[i]-1 : n-1);
        sum += (l - le + 1) * (re - r + 1) * i;
        l = min(l, (ll) loc[i]);
        r = max(r, (ll) loc[i]);
    }
    cout << sum << '\n';
}

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