#include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 2e5+10;
int T;
void getsa(int n,int s[],int sa[],int rk[],int bn[],int tp[]) {
	int m = n;
	memset(bn,0,(m+1)*sizeof bn[0]);
	for(int i = 1;i<=n;++i) ++bn[rk[i]=s[i]];
	for(int i = 2;i<=m;++i) bn[i] += bn[i-1];
	for(int i = n;i;--i) sa[bn[rk[i]]--] = i;
	for(int j = 1;j<n;j<<=1) {
		int cnt = 0;
		for(int i = n - j + 1;i<=n;++i) tp[++cnt] = i;
		for(int i = 1;i<=n;++i) if(sa[i] > j) tp[++cnt] = sa[i] - j;
		memset(bn+1,0,m * sizeof bn[0]);
		for(int i = 1;i<=n;++i) ++bn[rk[i]];
		for(int i = 2;i<=m;++i) bn[i] += bn[i-1];
		for(int i = n;i;--i) sa[bn[rk[tp[i]]]--] = tp[i];
		memcpy(tp+1,rk+1,n * sizeof tp[0]);
		cnt = rk[sa[1]] = 1;
		for(int i = 2;i<=n;++i)
			if(tp[sa[i]] == tp[sa[i-1]] && tp[sa[i]+j] == tp[sa[i-1]+j]) rk[sa[i]] = cnt;
			else rk[sa[i]] = ++cnt;
		if((m=cnt)==n) break;
	}
}
void gethr(int n,int s[],int sa[],int rk[],int hi[]) {
	for(int i = 1,k = 0;i<=n;++i) {
		if(k) --k;
		if(rk[i] == 1) continue;
		while(s[i+k] == s[sa[rk[i]-1]+k]) ++k;
		hi[i] = k;
	}
}
int n,a[maxn],ih[maxn],sa[maxn],rk[maxn],bn[maxn],tp[maxn];
auto&hi=bn;

void sol(){
	unordered_map<int,int>id;
	cin>>n;for(int i=1,_=0;i<=n;++i)cin>>a[i],ih[i]=(id.count(a[i])?id[a[i]]:id[a[i]]=++_);
	getsa(n,ih,sa,rk,bn,tp);
	gethr(n,ih,sa,rk,hi);

	static struct STK{
		int pos,val,sufans;
	}s[maxn];
	int tp=0,res = 0;
	s[0]={.pos=n+1,.val=0,.sufans=0};
	for(int i = n;i;--i) {
		while(tp && s[tp].val <= a[i]) s[tp--]={};
		int va=(s[tp].pos-i)*a[i]+s[tp].sufans;
		s[++tp]={.pos=i,.val=a[i],.sufans=va};

		int l=0,r=tp,ind = i+hi[i];// >= ind
		while(l < r){
			int mid=(l+r+1)>>1;
			if(s[mid].pos >= ind) l=mid;
			else r=mid-1;
		}
		res += s[l].sufans + (s[l+1].sufans-s[l].sufans)/(s[l].pos-s[l+1].pos)*(s[l].pos-ind);
	}while(tp)s[tp--]={};
	cout<<res<<'\n';
}

signed main() {
	ios::sync_with_stdio(0),cin.tie(0);
	int T;cin>>T;while(T--)sol();
}