#include <bits/stdc++.h>
#define int long long
const int N = 2e5 + 5;
using namespace std;

int a[200010];
void solve()
{
	stack<pair<int,int>> c;
	int n,ans=0,sum=1;
		cin>>n;
		for(int i=0;i<n;i++){
			cin>>a[i];
		}
		for(int i=1;i<n;i++){
			if(a[i]<a[i-1]){
				c.push({a[i-1],sum});
				sum=1;
			}
			else if(a[i]>a[i-1])
			{	
				ans+=sum; 
				sum++;
				while(c.size()&&c.top().first<=a[i]){
					if(c.top().first!=a[i]) ans+=c.top().second;
					sum+=c.top().second;
					c.pop();
				}

			}
			else 
			{
				sum++;
			}
			
		}
		while(c.size()){
			ans+=sum;
			sum+=c.top().second;
			c.pop();
		}
		cout<<ans<<"\n";
	
}

signed main()
{
	 ios::sync_with_stdio(0);
	 cin.tie(0);
	 cout.tie(0);

	int T;
	cin >> T;
	while (T--)
		solve();
}