#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

template<class T>
void bubbleSort(vector<T> &v){
    vector<pii> ans;
    for(int i = 0; i < (int)v.size(); ++i){
        for(int j = i; j > 0 && v[j - 1] > v[j]; --j){
            swap(v[j - 1], v[j]);
            ans.emplace_back(j, j+1);
        }
    }
    cout << sz(ans) << endl;
    each(a, ans)printf("%d %d\n", a.first, a.second);
}

int main(){
    int N, K;
    cin >> N >> K;
    vi X(K), Y(K);
    rep(i, K)scanf("%d%d", &X[i], &Y[i]);

    vi A(N);
    rep(i, N){
        scanf("%d", &A[i]);
    }
    rep(i, K){
        swap(A[X[i] - 1], A[Y[i] - 1]);
    }
    bubbleSort<>(A);
}