#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
const int N=1000001;
int n,a[N];
vector<pair<int,int>> ans;
void check(int x,int y)
{
    ans.push_back(make_pair(x,y));
    static int z[N];
    int q=0;
    for(int i=n-y+1;i<=n;++i) z[++q]=a[i];
    for(int i=x+1;i<=n-y;++i) z[++q]=a[i];
    for(int i=1;i<=x;++i) z[++q]=a[i];
    for(int i=1;i<=n;++i) a[i]=z[i];
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        ans.clear();
        for(int i=1;i<=n;++i)
        {
            scanf("%d",&a[i]);
        }
        if(n==3)
        {
            if(a[1]>a[3]) check(1,1);
            printf("%d\n",ans.size());
            for(auto i:ans) printf("%d %d\n",i.first,i.second);
            continue;
        }
        int x=0;
        while(a[x]!=1) ++x;
        if(x==2) check(2,1),check(1,1);
        else if(x>2) check(1,n-x+1);
        for(int i=1;i<=n-1;++i)
        {
            int x=1;
            while(x+1<=i&&a[x+1]<a[n]) ++x;
            if(x<n-2) check(x,2),check(1,x);
            else check(1,1),check(n-2,1),check(2,n-3),check(n-3,1),check(1,n-2);
        }
        printf("%d\n",ans.size());
        for(auto i:ans) printf("%d %d\n",i.first,i.second);
    }
    return 0;
}