#include <bits/stdc++.h>
using namespace std;

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

map<VI, int> m;
map<VI, PII> op;

void brute(int n)
{
	VI v(n);
	iota(ALL(v), 1);
	m[v] = 0;
	queue<VI> q;
	q.push(v);
	while (!q.empty())
	{
		auto b = q.front();
		q.pop();
		int a = m[b];
		FOR (x, 1, n - 2)
		{
			FOR (y, 1, n - x)
			{
				VI vec;
				FOR (i, 0, y) vec.PB(b[n - y + i]);
				FOR (i, x, n - y) vec.PB(b[i]);
				FOR (i, 0, x) vec.PB(b[i]);
				if (!m.count(vec))
				{
					m[vec] = a + 1;
					op[vec] = {y, x};
					q.push(vec);
				}
			}
		}
	}
}

vector<PII> oper;

void zrobyty(VI& a, VI& sz, PII p)
{
	int n = SZ(a);
	int x = 0, y = 0;
	FOR (i, 0, p.first) x += sz[i];
	FOR (i, 0, p.second) y += sz[SZ(a) - 1 - i];
	oper.PB({x, y});
	
	VI na, nsz;
	FOR (i, 0, p.second)
	{
		na.PB(a[n - p.second + i]);
		nsz.PB(sz[n - p.second + i]);
	}
	
	FOR (i, p.first, n - p.second)
	{ 
		na.PB(a[i]);
		nsz.PB(sz[i]);
	}
	FOR (i, 0, p.first)
	{
		na.PB(a[i]);
		nsz.PB(sz[i]);
	}
	a = na;
	sz = nsz;
}

void comp(VI& a, VI& sz, int k)
{
	int n = SZ(a);
	VI na;
	VI nsz;
	FOR (i, 0, n)
	{ 
		if (a[i] != k) 
		{
			na.PB(a[i] < k ? a[i] : a[i] - 1);
			nsz.PB(sz[i]);
		}
		else
		{
			assert(na.back() == k - 1);
			nsz.back() += sz[i];
		}
	}
	a = na;
	sz = nsz;
}

void solve(VI a, VI sz)
{
	int n = SZ(a);
	if (SZ(a) <= 7)
	{
		while (m[a] != 0)
		{
			PII p = op[a];
			zrobyty(a, sz, p);
		}
		return;
	}
	VI pos(n);
	FOR(i, 0, n)
		pos[a[i] - 1] = i;
		
	FOR(it,	1, n){
		int i = pos[it - 1];
		int j = pos[it];
		if(j > i || i >= n - 2) continue;
	
			int k = a[j];
			zrobyty(a, sz, {i + 1, 1});
			zrobyty(a, sz, {n - 1 - (i - j), 1});
			
			comp(a, sz, k);
			assert(SZ(a) == n - 1);
			
			solve(a, sz);
			
			return;
	}
	
	FOR(it,	1, n){
		int i = pos[it];
		int j = pos[it - 1];
		if(j > i || i >= n - 1) continue;

		int k = a[i];
		zrobyty(a, sz, {j + 1, 1});
		zrobyty(a, sz, {i - j, 1});
	
		comp(a, sz, k);
		assert(SZ(a) == n - 1);
		solve(a, sz);
				
		return;
	}
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	for (int i = 4; i <= 7; i++) brute(i);
	
	int t;
	cin >> t;
	while (t--)
	{
		int n;
		cin >> n;
		VI a(n);
		FOR (i, 0, n) cin >> a[i];
		if (n == 3)
		{
			if (a[2] < a[0])
				cout << "1\n1 1\n";
			else
				cout << "0\n";
			continue;
		}
		VI sz(n, 1);
		solve(a, sz);
		cout << SZ(oper) << '\n';
		FOR (i, 0, SZ(oper))
		{
			cout << oper[i].first << ' ' << oper[i].second << '\n';
		}
	}
	
	return 0;
}