#include <algorithm>
#include <cstdio>
#include <vector>
#define x first
#define y second
#define pb emplace_back

using namespace std;

int main() {
  int T;
  scanf("%d", &T);
  while (T--) {
    int n;
    scanf("%d", &n);
    vector<long long> a(n + 1, 0LL);
    for (int i = 1; i <= n; ++i) scanf("%lld", &a[i]);
    vector<pair<long long, long long>> p;
    long long ans = 0;
    for (int i = 1; i <= n; ++i) {
      long long j = i;
      while (!p.empty() && p.back().x < a[i]) {
        j = p.back().y;
        p.pop_back();
        ans += i - j;
      }
      if (p.empty() || p.back().x > a[i]) p.pb(a[i], j);
    }
    while (p.size() > 1) {
      ans += n + 1 - p.back().x;
      p.pop_back();
    }
    printf("%lld\n", ans);
  }
}