#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define allpt(v) (v).begin(), (v).end()
#define allpt_r(v) (v).rbegin(), (v).rend()



const int mod = 1e9 + 7;
const string wsp = " ";
const string tb = "\t";
const string rt = "\n";

template <typename T>
void show1dvec(vector<T> v)
{
    int n = v.size() - 1;
    rep(i, n) cout << v[i] << wsp;
    cout << v[n] << rt;
    return;
}

template <typename T>
void show2dvec(vector<vector<T>> v)
{
    int n = v.size();
    rep(i, n) show1dvec(v[i]);
}

int main()
{

#ifdef DEBUG
    cout << "DEBUG MODE" << endl;
    ifstream in("input.txt"); //for debug
    cin.rdbuf(in.rdbuf());    //for debug
#endif

    int n, m, a, b, k;
    cin >> n >> m;
    VI amida(n + 1), result(n + 1, 0), result2(n + 1, 0);
    iota(allpt(amida), 0);
    vector<PII> ans;

    rep(i, m)
    {
        cin >> a >> b;
        swap(amida[a], amida[b]);
    }

    rep(i, n)
    {
        cin >> result2[i + 1];
    }
    rep(i, n + 1) result[result2[i]] = i;
    // show1dvec(result);
    // show1dvec(amida);
    rep(i, n + 1)
    {
        rep(j, n + 1)
        {
            if (amida[j] == result[i])
            {
                k = j;
            }
        }

        for (int j = k; j > i; j--)
        {
            swap(amida[j - 1], amida[j]);
            ans.push_back(make_pair(j - 1, j));
        }
        // show1dvec(amida);
    }

    cout << ans.size() << rt;
    for (auto z : ans)
        cout << z.first << wsp << z.second << rt;

    return 0;
}