#include<iostream>

#include<vector>

#include<cstdio>

#include<algorithm>

using namespace std;

int a[];

void change(int l,  int r){

    for(int i = l, j = l+(r-l)/+; j <= r; ++i, ++j)

        swap(a[i], a[j]);

}

vector<pair<int, int>> Road;

int n;

int main(){

    int T; cin >> T;

    while (T--){

        cin >> n;

        Road.clear();

        for(int i = ; i < n; ++i) cin >> a[i];  //计算到i时，前面的位置已经排好了

        for(int i = ; i < n; ++i){

            int pos = find(a, a + n, i + ) - a;

            if(pos == i) continue;

            if(i + *(pos-i) <= n){   //i+1可以直接交换到i位置(后面有足够的数，不越界)

                Road.push_back(make_pair(i+, i + *(pos-i)));

                change(i, i + *(pos-i) - );

            }

            else{                    //交换到前一半

                if((pos-i)%){  //偶数个

                    Road.push_back(make_pair(i+, pos + ));

                    change(i, pos);

                }

                else{

                    Road.push_back(make_pair(i+, pos + ));

                    change(i + , pos);

                }

                --i;

            }

        }

        cout << Road.size() << endl;

        for(long long i=;i<Road.size();i++) printf("%d %d\n", Road[i].first, Road[i].second);

    }

    return ;

}