#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

int N, K;

int findIndex( vector<int> *m_array, int value )
{
    auto iter = std::find( m_array->begin(), m_array->end(), value);
    size_t index = std::distance( m_array->begin(), iter );
    if(index == m_array->size())
    {
        return -1;
    }
    return index;
}

void swap(vector<int> *vec, int x) {
    int tmp = vec->at(x);
    vec->at(x) = vec->at(x+1);
    vec->at(x+1) = tmp;
}

signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin >> N >> K;
    vector<int> A(N);
    vector<int> T(N);
    REP(i, N) A[i] = i;
    int x, y;
    REP(i, K) {
        cin >> x >> y;
        x--;
        swap(&A, x);
    }
    int t;
    REP(i, N) {
        cin >> t;
        T[--t] = i;
    }

    typedef pair<int, int> pos;
    vector<pos> ans;
    RREP(to, N) {
        int target = T[to];
        int from = findIndex(&A, target);
        FOR(j, from, to) {
            ans.push_back(*new pos(j+1, j+2));
            swap(&A, j);
        }
    }
    cout << ans.size() << endl;
    for (auto p : ans) {
        cout << p.first << " " << p.second << endl;
    }

    return 0;
}