#include<bits/stdc++.h>
#define int long long



void solve(){
	

	int n;
	std::cin >> n;
	
	std::vector<int> a(n + 2, INT32_MAX - 1);
	for (int i = 1; i <= n; i++) std::cin >> a[i];
	
	int ans = 0;
	std::priority_queue<std::pair<int,int>, std::vector<std::pair<int,int>>, std::greater<>> pq;
	
	std::function<void()> fun = [&]() -> void {
		pq.push({INT32_MAX,0});
		for (int i = 1; i <= n + 1; i++) {
			if (pq.top().first > a[i]) {
				pq.push({a[i], i});
			} else {
				while (pq.top().first <= a[i]) {
					ans += i - pq.top().second - 1;
					pq.pop();
				}
				pq.push({a[i], i});
			}
		}
		while (pq.size()) pq.pop();
	};
	
	fun();
	std::reverse(a.begin(),a.end());
	fun();
	
	std::cout << ans << '\n';
	
	
	
	
	
}


signed main(){
	
	//std::ios::sync_with_stdio(false), std::cin.tie(nullptr);
	
	int _ = 1;
	std::cin >> _;
	while (_) solve(), --_;
	
	return (0^_^0);
	
}