#include <iostream>
#include <unordered_map>
#include <algorithm>
using namespace std;
using ll = long long;

struct Node{
	ll cnt;
	int v;
};

unordered_map<ll, Node> s;

int main() {
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	int t; cin >> t;
	while (t --) {
		unordered_map<ll, Node>().swap(s);
		int n; cin >> n;
		int p = 0;
		ll ans = 0;
		for (int i = 1; i <= n; i ++) {
			int v; cin >> v;
			ll cnt = 1;
			while (p > 1 && s[p - 1].v < v) {
				s[p - 1].cnt += s[p].cnt;
				ans += s[p].cnt;
				p --;
			}
			while (p && s[p].v <= v) {
				if (s[p].v != v) ans += s[p].cnt;
				cnt += s[p].cnt;
				p --;
			}
			cout << v << ' ' << cnt << ' ' << ans << endl;
			s[++ p] = Node{cnt, v};
		}
		if (p != 1) {
			int v = s[1].v;
			ll cnt = 0;
			while (p && s[p].v < v) {
				cnt += s[p].cnt;
				p --;
			}
		}
		cout << ans << '\n';
	}
}