//
// Created by 夕 on 2024/9/16.
//
#include <bits/stdc++.h>
using namespace std;
#define ll long long
void solu(){
    ll n;
    cin >> n;
    vector <ll> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    vector <ll> rIndex(n,-1);
    vector <ll> lIndex(n,-1);
    stack <pair <ll,ll>> s; //单调栈
    for (ll i = 0; i < n; ++i) {
        while (!s.empty() && s.top().second <= a[i]) {
            ll idx = s.top().first;
            rIndex[idx] = i;
            s.pop();
        }
        s.emplace(i, a[i]);
    }
    while (!s.empty()) s.pop();
    for (ll i = n - 1; i >= 0; --i) {
        while (!s.empty() && s.top().second <= a[i]) {
            ll idx = s.top().first;
            lIndex[idx] = i;
            s.pop();
        }
        s.emplace(i, a[i]);
    }

    ll ans = 0;
    for (int i = 0; i < n; ++i) {
        if (lIndex[i] != -1){
            ans += (i - 1 - lIndex[i]);
        }
        else {
            if (a[0] != a[i]){
                ans += i;
            }
        }
        if (rIndex[i] != -1){
            ans += (rIndex[i] - i - 1);
        }
        else {
            if (a[n-1] != a[i]){
                ans += (n - i - 1);
            }
        }
    }

    cout<<ans<<endl;
    for (int i = 0; i < n; ++i) {
        cout<<i<<"  "<<lIndex[i]<<"  "<<rIndex[i]<<endl;
    }
}
int main(){
    ll q;
    cin >> q;
    while (q--){
        solu();
    }
}