#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=4e5+5;
int n,a[N],l[N],r[N],stk[N];
int main(){
	int t;
	cin>>t;
	while(t--){
		ll ans=0;
		scanf("%d",&n);
		for(int i=1;i<=n;i++){
			scanf("%d",&a[i]);
		}
		int top=0;
		for(int i=1;i<=n;i++){
			while(top&&a[i]>a[stk[top]]){
				top--;
			}
			l[i]=stk[top]+1;
			stk[++top]=i;
		}
		top=0;stk[top]=n+1;
		for(int i=n;i>=1;i--){
			while(top&&a[i]>a[stk[top]]){
				top--;
			}
			r[i]=stk[top]-1;
		//	if(a[r[i]+1]==a[i]){
		//		r[i]=i;
		//	}
			stk[++top]=i;
		}
		for(int i=1;i<=n;i++){
			cout<<l[i]<<" "<<r[i]<<endl;
			ans+=r[i]-l[i];
		}
		printf("%lld\n",ans);
	}
	return 0;
}