#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(), v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define INF (ll)1e9
#define oo (ll)1e18
#define MOD (ll)(1e9 + 7)
#define double long double
using namespace std;
template<class T1, class T2>
bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}
template<class T1, class T2>
bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}
template<class T1, class T2>
void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}
template<class T1, class T2>
void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}
template<class T>
void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}
const int MAX = 1003;
int N, S;
int a[MAX];
void input(){
cin >> N >> S;
for(int i = 1; i <= N; i++) cin >> a[i];
}
namespace subtask2{
vector<pair<int, int>> ans;
void Swap(int i, int j){
ans.push_back({i, j});
ans.push_back({j, i});
ans.push_back({i, j});
}
void solve(){
for(int i = 1; i <= N; i++){
for(int j = 2; j <= N; j++){
if(a[j] < a[j - 1]){
swap(a[j], a[j - 1]);
Swap(j, j - 1);
}
}
}
cout << sz(ans) << '\n';
for(auto x: ans){
cout << x.fi << ' ' << x.se << '\n';
}
}
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
// freopen("fence.inp", "r", stdin);
// freopen("fence.out", "w", stdout);
input();
return subtask2::solve(), 0;
return 0;
}
