#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define op(x) ((x&1)?x+1:x-1)
#define odd(x) (x&1)
#define even(x) (!odd(x))
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define lowbit(x) (x&-x)
#define mp(x,y) make_pair(x,y)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
using namespace std;
const int MAXN = 1010;

int T,n,p[MAXN],q[MAXN],rk[MAXN];
typedef array<int,2> pr;

vector<pr>ret;

void opt(int x,int y){
	assert(x>0);
	assert(y>0);
	assert(x+y<n);

	//printf("opt (%d,%d)\n",x,y);

	rep(i,1,n)q[i] = p[i];
	rep(i,1,y)p[i] = q[n-y+i];
	rep(i,1,n-x-y)p[y+i] = q[x+i];
	rep(i,1,x)p[n-x+i] = q[i];

	rep(i,1,n)rk[p[i]] = i;

	ret.push_back({x,y});

	//rep(i,1,n)cout<<p[i]<<" ";cout<<endl;
}

void solve(){
	cin>>n;
	rep(i,1,n)cin>>p[i],rk[p[i]] = i;

	if(n == 3){ //corner case 
		if(p[1] < p[3])cout<<"0\n";
		else cout<<"1\n1 1\n";
		return;
	}
	ret.clear();
	
	if(rk[1]>2)opt(1,n-rk[1]+1);
	else if(rk[1] == 2)opt(2,1),opt(1,1);
	
	rep(x,1,n-1){
		if(rk[x+1] == x+1)continue;
		//增量构造
		if(rk[x+1] != x+2){ //简单情况
			opt(x,n-rk[x+1]+2);
			opt(1,x);
			continue;
		}
		//printf("now %d\n",x);
		int y = p[x+1],z = p[x+3];
		auto F1 = [&](){
			//printf("f1\n");
			assert(x>1);
			opt(x-1,n-rk[x+1]+1);
			opt(rk[x]-1,n-rk[y]+1);
			opt(1,n-rk[x]+1);
			opt(1,1);
			opt(1,x);
			//printf("here\n");
		};
		auto F2 = [&](){
			//printf("f2\n");

			assert(x+2<n);
			opt(x,n-rk[x+1]+1);
			opt(1,n-rk[y]+1);
			opt(1,1);
			opt(1,n-rk[z]+1);
			opt(rk[z],n-rk[1]+1);
		};
		//
		if(x+2 == n)F1();
		else if(x==1)F2();
		else{
			assert(z);
			if(z != x+2)F2();
			else F1();
		}
		/*
		printf("done x = %d : \n",x);
		rep(j,1,n)cout<<p[j]<<" ";cout<<endl;
		exit(0);
		*/
	}

	rep(i,1,n)assert(p[i] == i);

	cout<<ret.size()<<"\n";
	for(auto [x,y] : ret)cout<<x<<" "<<y<<"\n";
}

int main(){
	ios::sync_with_stdio(false);cin.tie(0);

	cin>>T;
	while(T--)solve();

    return 0;
}