#include <iostream>
#include <vector>
#include <map>
#include <algorithm>

using namespace std;

#define FOR(x,y) for(int x = 0;x < y;x++)

template<int um> class UF {
public:
    vector<int> par,rank,cnt;
    UF() {par=rank=vector<int>(um,0); cnt=vector<int>(um,1); for(int i=0;i<um;i++) par[i]=i;}
    void reinit() {FOR(i,um) rank[i]=0,cnt[i]=1,par[i]=i;}
    int operator[](int x) {return (par[x]==x)?(x):(par[x] = operator[](par[x]));}
    int count(int x) { return cnt[operator[](x)];}
    int operator()(int x,int y) {
        if((x=operator[](x))==(y=operator[](y))) return x;
        cnt[y]=cnt[x]=cnt[x]+cnt[y];
        if(rank[x]>rank[y]) return par[x]=y;
        rank[x]+=rank[x]==rank[y]; return par[y]=x;
    }
};

int main(int argc, const char * argv[]) {
    int N, K;
    cin >> N >> K;
    
    vector<int> data(N);
    FOR(i,N){
        data[i] = i;
    }
    FOR(i,K){
        int x, y;
        cin >> x >> y;
        swap(data[x-1], data[y-1]);
    }
    vector<int> A(N);
    FOR(i,N)cin >> A[i], --A[i];
    
    vector<pair<int,int>> swaps;
    FOR(t,N){
        for(int i=0;i+1<N;i++){
            if(A[data[i]] > A[data[i+1]]){
                swaps.emplace_back(i, i+1);
                swap(data[i], data[i+1]);
            }
        }
    }
    cout << swaps.size() << endl;
    for(auto swp : swaps){
        cout << swp.first + 1 << " " << swp.second + 1 << endl;
    }
    return 0;
}