/*
¤ï¤ó¤ï¤ó¡­¡­¤ï¤ó¤À¤Û©`¤¤¤Ã¡î
Wonderhoy!
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double DB;
char buf[1<<21],*p1=buf,*p2=buf;
#define getchar() (p1==p2 && (p2=(p1=buf)+fread(buf,1,1<<18,stdin),p1==p2)?EOF:*p1++)
int read()
{
	int x=0;
	char c=getchar();
	while(c<'0' || c>'9')	c=getchar();
	while(c>='0' && c<='9')	x=(x<<1)+(x<<3)+(c^'0'),c=getchar();
	return x;
}
void write(int x)
{
	if(x>9)	write(x/10);
	putchar(x%10+'0');
}
typedef pair<int,int> P;
#define mp make_pair
#define spc putchar(' ')
#define etr putchar('\n')
#define inlp(x,y) putchar(x==y?'\n':' ')
void Solve();
int main(){
	int T=read();
	while(T-->0)	Solve();
	return 0;
}
int n;
int a[1005],b[1005];
vector<P> Ans;
void swp(int p,int q)
{
	int c=0;
	for(int i=q+1;i<=n;++i)	b[++c]=a[i];
	for(int i=p;i<=q;++i)	b[++c]=a[i];
	for(int i=1;i<p;++i)	b[++c]=a[i];
	for(int i=1;i<=n;++i)	a[i]=b[i];
	Ans.push_back(mp(p-1,n-q));
}
int getpos(int w){return find(a+1,a+1+n,w)-a;}
void Solve()
{
	Ans.clear();
	n=read();
	for(int i=1;i<=n;++i)	a[i]=read();
	if(n==3)
	{
		if(a[1]>a[3])	swp(2,2);
	}
	else
	{
		if(a[1]^1)
		{
			int p=getpos(1);
			if(p==2)	swp(3,3),swp(2,n-1);
			else	swp(p-1,p-1);
		}
		for(int i=2;i<=n-2;++i)
		{
			if(a[i]==i)	continue;
			int p=getpos(i);
			if(p==n)
			{
				swp(n-2,n-2);
				swp(2,n-i+1);
			}
			else
			{
				swp(i,p);
				p=getpos(i);
				swp(p,p);
			}
		}
		if(a[n]^n)	swp(n-2,n-1),swp(2,2),swp(2,n-1),swp(n-1,n-1),swp(2,3);
	}
	write(int(Ans.size())),etr;
	for(auto st:Ans)	write(st.first),spc,write(st.second),etr;
}