#include<bits/stdc++.h>
#define fcc(i, j, k) for(num (i)=(j); (i)<=(k); ++(i))
#define ccf(i, j, k) for(num (i)=(j); (i)>=(k); --(i))
using std::cin;
using std::cout;
using std::min;
using std::max;
using std::vector;
using std::string;
using std::pair;
using std::make_pair;
using num = int;
using Num = long long;
using pnum = pair<num, num>;
const char newl = '\n', *snewl = " \n";
inline Num read()
{
    Num ret = 0, s = 1, c = getchar();
    for(; !isdigit(c); c = getchar()) if(c == '-') s = -1;
    for(; isdigit(c); c = getchar()) ret = (ret << 1) + (ret << 3) + (c ^ 48);
    return s * ret;
}
inline string readstr()
{
    string ret; char c;
    for(; (c = getchar()) <= ' ';);
    for(; c > ' '; c = getchar()) ret += c;
    return ret;
}
template<typename T>
inline void min_(T &a, const T &b) { if(b < a) a = b; }
template<typename T>
inline void max_(T &a, const T &b) { if(a < b) a = b; }

void solve()
{
    num N = read();
    vector<num> A(N + 10), B(N + 10);
    fcc(i, 1, N) A[i] = read();
    vector<pnum> ans;
    auto opt = [&](num x, num y)
    {
        ans.emplace_back(x, y);
        num M = 0;
        fcc(i, N - y + 1, N) B[++M] = A[i];
        fcc(i, x + 1, N - y) B[++M] = A[i];
        fcc(i, 1, x) B[++M] = A[i];
        A = B;
    };
    auto find = [&](num i) { fcc(j, 1, N) if(A[j] == i) return j; };
    if(N == 3)
    {
        if(A[1] > A[3]) opt(1, 1);
    }
    else
    {
        num p = find(1);
        if(p == 2) opt(2, 1), opt(1, 1);
        else if(p > 2) opt(1, N - p + 1);
        fcc(i, 2, N - 2)
        {
            p = find(i);
            if(p == N) opt(i - 1, 2), opt(1, i - 1);
            else if(p > i) opt(i - 1, N - p), opt(N - i, i - 1);
        }
        if(A[N - 1] > A[N])
        {
            opt(N - 3, 1);
            opt(1, N - 2);
            opt(1, 1);
            opt(N - 2, 1);
            opt(1, N - 3);
        }
    }
    cout << ans.size() << newl;
    for(auto pa : ans) cout << pa.first << ' ' << pa.second << newl;
}
num main()
{
    #ifndef ONLINE_JUDGE
    freopen("_.in", "r", stdin);
    freopen("_.out", "w", stdout);
    #endif
    std::ios::sync_with_stdio(0), cin.tie(0);

    for(num T = read(); T --> 0;) solve();
    return 0 ^ 0;
}