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

typedef pair<int, int> pii;
const int N = 110;
int T, n, a[N], t[N];
vector<pii> ans;

void Solve(){
	ans.clear();
	cin >> n;
	for (int i = 1; i <= n; i++){
		cin >> a[i];
		t[i] = a[i];
	}
	
	sort(t + 1, t + n + 1);
	for (int i = n; i >= 1; i--)
		if (a[i] ^ t[i]){
			for (int j = 1; j < i; j++)
				if (a[j] > a[i]){
					sort(a + j, a + i + 1);
					ans.push_back(mp(j, i));
					break;
				}
		}
	
	cout << ans.size() << endl;
	for (auto e : ans){
		int l, r;
		tie(l, r) = e;
		cout << l << " " << r << endl; 
	}
}

signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	cin >> T;
	
	while (T--)
		Solve();
	
	return 0;
}