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

//#define int long long

typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define endl '\n'
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
template<class T,class U>void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>void chmax(T &t,U f){if(t<f)t=f;}

int N,K;
int la[100];
int to[100];

int main(){
    cin>>N>>K;
    rep(i,N)la[i]=i;
    rep(i,K){
        int a,b;cin>>a>>b;a--;b--;
        swap(la[a],la[b]);
    }
    rep(i,N){
        int a;cin>>a;a--;
        to[a]=i;
    }
    rep(i,N)la[i]=find(to,to+N,la[i])-to;

    vpint ans;
    rep(i,N){
        rep(j,N-1){
            if(la[j]>la[j+1]){
                swap(la[j],la[j+1]);
                ans.pb(pint(j,j+1));
            }
        }
    }
    cout<<ans.size()<<endl;
    rep(i,ans.size())cout<<ans[i].fi+1<<" "<<ans[i].se+1<<endl;

    return 0;
}