#pragma comment(linker, "/STACK:1024000000,1024000000")#include <cstdio>#include <string>#include <cstdlib>#include <cmath>#include <iostream>#include <cstring>#include <set>#include <queue>#include <algorithm>#include <vector>#include <map>#include <cctype>#include <cmath>#include <stack>#include <tr1/unordered_map>#define freopenr freopen("in.txt", "r", stdin)#define freopenw freopen("out.txt", "w", stdout)using namespace std;using namespace std :: tr1;typedef long long LL;typedef pair<int, int> P;const int INF = 0x3f3f3f3f;const double inf = 0x3f3f3f3f3f3f;const LL LNF = 0x3f3f3f3f3f3f;const double PI = acos(-1.0);const double eps = 1e-8;const int maxn = 1e5 + 5;const int mod = 1e9 + 7;const int N = 1e6 + 5;const int dr[] = {-1, 0, 1, 0};const int dc[] = {0, 1, 0, -1};const char *Hex[] = {"0000", "0001", "0010", "0011", "0100", "0101", "0110", "0111", "1000", "1001", "1010", "1011", "1100", "1101", "1110", "1111"};inline LL gcd(LL a, LL b){  return b == 0 ? a : gcd(b, a%b); }int n, m;const int mon[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};const int monn[] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};inline int Min(int a, int b){ return a < b ? a : b; }inline int Max(int a, int b){ return a > b ? a : b; }inline LL Min(LL a, LL b){ return a < b ? a : b; }inline LL Max(LL a, LL b){ return a > b ? a : b; }inline bool is_in(int r, int c){    return r >= 0 && r < n && c >= 0 && c < m;}int pos[maxn], a[maxn];void Swap(int l, int r){    int mid = (r-l+1)/2;    for(int i = 0; i < mid; ++i){        swap(pos[a[l]], pos[a[l+mid]]);        swap(a[l], a[l+mid]);        ++l;    }}vector<P> ans;int main(){    int T;  cin >> T;    while(T--){        scanf("%d", &n);        for(int i = 1; i <= n; ++i){            scanf("%d", a+i);            pos[a[i]] = i;        }        ans.clear();        for(int i = 1; i <= n; ++i){            int id = pos[i];            if(i == a[i])  continue;            if((id-i)*2+i-1 <= n){                Swap(i, (id-i)*2+i-1);                ans.push_back(P(i, (id-i)*2+i-1));            }            else if((id-i) & 1){                Swap(i, id);                ans.push_back(P(i, id));            }            else if(id == n){                Swap(n-1, n);                ans.push_back(P(n-1, n));            }            else{                Swap(i, id+1);                ans.push_back(P(i, id+1));            }            --i;        }        printf("%d\n", ans.size());        for(int i = 0; i < ans.size(); ++i)            printf("%d %d\n", ans[i].first, ans[i].second);    }    return 0;}