#include <bits/stdc++.h>
#define rep(i, j, k) for(int i=(j);i<=(k);++i)
#define per(i, j, k) for(int i=(j);i>=(k);--i)
#define mem(a, b) memset(a,b,sizeof(a))
#define pii pair<int,int>
#define lson (p<<1)
#define rson (p<<1|1)
#define int long long
#define enter putchar('\n')
#define space putchar(' ')
const int mod=998244353, NMAX=1e5+5, INF=0x3f3f3f3f3f3f3f3f;
using namespace std;
inline int read() {
  int x = 0, f = 1;
  char c = getchar();
  while (c < '0' || c > '9') f = c == '-' ? -1 : f, c = getchar();
  while (c >= '0' && c <= '9') x = (x<<3)+(x<<1)+(c^48), c = getchar();
  return x*f;
}
inline void write(int x) {
  if (x < 0) x = -x, putchar('-');
  if (x > 9) write(x/10);
  putchar('0' + x%10);
}

int a[NMAX];

void solve() {
    int n=read(), top=0, ans=0;
    vector <int> stk(n+1), b(n+1);
    rep(i, 1, n) a[i]=read();
    rep(i, 1, n) {
        while(top && a[ stk[top] ] < a[i]) top --;
        if(top == 0)
            ans += i-1;
        else if(a[ stk[top] ] == a[i])
            b[i] = b[ stk[top] ], ans += b[i], top --;
        else
            ans += i-stk[top]+b[ stk[top] ], b[i] = b[ stk[top] ] + 1;
        stk[++ top] = i;
    }
    write(ans), enter;
}

signed main() {
  int _ = 1;
  _ = read();
  while(_ --) {
    solve();
  }
  return 0;
}