uvalive 6588

#include <cstdio>
#include <map>
#include <iostream>
#include <cstring>
#include <cmath>
#include <queue>
#include <algorithm>
#include <vector>
using namespace std;

int data[10010],n;
struct node{
	int a,b;
};
vector<node> ans;
int find(int x)
{
	for(int i=1;i<n+1;i++)
	{
		if(data[i]==x)
		{
			return i;
		}
	}
	return 0;
}
void solve(int st,int ed)
{
	node tp;
	tp.a=st;tp.b=ed;
	ans.push_back(tp);
	int mid=st+ed;
	int l=ed-st+1;
	l=l/2;
	mid=mid/2;
	for(int i=0;i<l;i++)
	{
		swap(data[i+st],data[i+l+st]);
	}
}
int main()
{
	int T;
	//freopen("data.in","r",stdin);
	//freopen("data.out","w",stdout);
	scanf("%d",&T);
	while (T--){
		ans.clear();
		scanf("%d",&n);
		for(int i=1;i<=n;i++){
			scanf("%d",data+i);
		}

		for(int i=1;i<=n;i++){
//		for(int j=1;j<=n;j++) printf("%d ",data[j]);puts("");
			int x=find(i),l=n+1-i;
			if(x==i) {continue;}
			if((l/2)+i<x){
				int p=x-(x-(i+(l/2)))*2+1;
				solve(p,x);
				solve(i,(l/2)*2+i-1);
			}
			else {
				int p=x-i+x-1;
				solve(i,p);
			}
		}
		printf("%d\n",ans.size());
		for(int i=0;i<ans.size();i++)
		{
			printf("%d %d\n",ans[i].a,ans[i].b);
		}
	}
	return 0;
}