# include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); };
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); };
typedef pair<LL, LL> pii;
const int vy[] = { -1, -1, -1, 0, 1, 1, 1, 0 }, vx[] = { -1, 0, 1, 1, 1, 0, -1, -1 };
const int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(LL n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(LL n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
LL gcd(LL a, LL b) { if (b == 0)return a; return gcd(b, a%b); };
LL lcm(LL a, LL b) { LL g = gcd(a, b); return a / g*b; };
# define ALL(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        sort(ALL((wpwpw)));(wpwpw).erase(unique(ALL((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(ALL((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(ALL((rprpr)),(rprpr).begin(),TU<char>)
# define FOR(i,tptpt,ypypy)   for(LL i=(tptpt);i<(ypypy);i++)
# define REP(i,upupu)         FOR(i,0,upupu)
# define INIT                 std::ios::sync_with_stdio(false);std::cin.tie(0)

int n, k;
int x[6060], y[6060];
vector<int> a, ju, b;
vector<pair<int, int>> ans;
int main(){
    INIT;
    cin >> n >> k;
    REP(i, k){
        cin >> x[i] >> y[i];
        x[i]--, y[i]--;
    }
    a.resize(n);
    ju.resize(n);
    b.resize(n);
    REP(i, n)ju[i] = i;
    REP(i, n){
        cin >> a[i];
        a[i]--;
        b[a[i]] = i;
    }
    REP(i, k){
        swap(ju[x[i]], ju[y[i]]);
    }
    REP(i, n){
        for(int j = i;j < n;j++){
            if(b[i] == ju[j]){
                for(int l = j - 1;l >= i;l--){
                    swap(ju[l], ju[l + 1]);
                    ans.emplace_back(make_pair(l + 1, l + 2));
                }
            }
        }
    }
    cout << ans.size() << endl;
    REP(i, (int)ans.size()){
        cout << ans[i].first<< " " << ans[i].second << endl;
    }
}