#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

int main()
{
    int n, k;
    cin >> n >> k;

    vector<int> b(n+1);
    for(int i=1; i<=n; ++i)
        b[i] = i;
    for(int i=0; i<k; ++i){
        int x, y;
        cin >> x >> y;
        swap(b[x], b[y]);
    }

    vector<int> a(n+1);
    for(int i=1; i<=n; ++i)
        cin >> a[i];

    vector<int> ans;
    for(int i=1; i<=n; ++i){
        int x = find(a.begin(), a.end(), i) - a.begin();
        int j = find(b.begin(), b.end(), x) - b.begin();
        while(j > i){
            -- j;
            ans.push_back(j);
            swap(b[j], b[j+1]);
        }
    }

    cout << ans.size() << endl;
    for(int x : ans)
        cout << x << ' ' << (x + 1) << endl;
    return 0;
}