#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#define int long long
#define pb push_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define ff first
#define ss second
#define bb begin()
#define ee end()
#define pii pair<int,int>
using namespace std;
void solve()
{
	int n;cin>>n;
	vi a(n+1);
	for(int i=1;i<=n;i++) cin>>a[i];
	int r=0,l=0;
	
	for(int i=n;i>=1;i--) {
		if(a[i]!=i) {
			r=i;
			break;
		}
	}
	for(int i=1;i<=n;i++) {
		if(a[i]>a[r]) {
			l=i;
			break;
		}
	}
	int l1=0;
	for(int i=1;i<=n;i++) {
		if(a[i]!=i) {
			l1=i;
			break;
		}
	}
	if(l==1) {
		cout<<"1\n";
		cout<<"1 "<<n<<"\n";
		return ;
	}
	if(r==0) {
		cout<<"0\n";
		return ;
	}
	if(l1==0) {
		cout<<"1\n";
		cout<<"1 "<<r<<"\n";
	}
	else {
		cout<<"2\n";
		cout<<l<<" "<<r<<"\n";
		cout<<1<<" "<<l<<"\n";
	}
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int T;cin>>T;
	while(T--)
	{
		solve();
	}
	return 0;
}