#include <bits/stdc++.h>
#define x first
#define y second

using namespace std;
#define ll long long
typedef pair<int, int> PII;
typedef long long LL;
const int N = 1e7+10;
const int MAX = 0x3f3f3f3f;
const int mod = 1e6+7;

void solve(){
	int n;
	cin >> n;
	vector<int> a(n), l(n), r(n);
	for(int i = 0; i < n; i++){
		cin >> a[i];
	}
	vector<int> stk;
	for(int i = 0; i < n; i++){
		while(!stk.empty() && a[i] > a[stk.back()])stk.pop_back();
		if(stk.empty())l[i] = 0;
		else {
			l[i] = stk.back()+1;
		}
		stk.push_back(i);
	}
	stk.clear();
	reverse(a.begin(), a.end());
	for(int i = 0; i < n; i ++){
		while(!stk.empty() && a[i] > a[stk.back()])stk.pop_back();
		if(stk.empty())r[i] =0;
		else {
			r[i] = stk.back()+1;
		}
		if(r[i] >= 1 && a[r[i]-1] == a[i])
		r[i] = i;
		stk.push_back(i);	
		
		
	}
	reverse(r.begin(), r.end());
	for(int i = 0; i < n; i++)r[i] = n-r[i]-1;
	ll res = 0;
	for(int i = 0; i < n; i++) {
		res+= r[i]-l[i];
		cout << l[i] << " " <<r[i]<<endl; 
	}
	//cout << endl;
		cout << res <<endl;
}
int main() {
	int t;
	cin >> t;
	while(t--){
		solve();
	}
	return 0;
}