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

int main() {
    int n,k;
    cin>>n>>k;
    int a[n];
    for (int i=0;i<n;i++)
        a[i]=i;
    while (k--) {
        int b,c;
        cin>>b>>c;
        swap(a[b-1],a[c-1]);
    }
    int b[n];
    for (int i=0;i<n;i++) {
        cin>>b[i];
        b[i]--;
    }
    vector<int> v;
    for (int i=1;i<n;i++)
        for (int j=0;j<n-i;j++)
            if (b[a[j]]>b[a[j+1]]) {
                swap(a[j],a[j+1]);
                v.push_back(j+1);
            }
    cout<<v.size()<<endl;
    for (int x:v) {
        cout<<x<<' '<<x+1<<endl;
    }
        
    return 0;
}