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

vector<int> inv(const vector<int> &p) {
  vector<int> q(p.size());
  for (int i = 0; i < p.size(); i++) q[p[i]] = i;
  return q;
}

int main() {
  int n, k;
  cin >> n >> k;
  vector<int> b(n);
  iota(b.begin(), b.end(), 0);
  for (int i = 0; i < k; i++) {
    int x, y;
    cin >> x >> y;
    x--, y--;
    swap(b[x], b[y]);
  }
  vector<int> a(n);
  for (int i = 0; i < n; i++) cin >> a[i], a[i]--;
  a = inv(a);

  vector<pair<int, int>> ans;
  for (int i = 0; i < n; i++) {
    if (b[i] == a[i]) continue;
    int j;
    for (j = i + 1; j < n; j++) {
      if (a[i] == b[j]) break;
    }
    for (int k = j - 1; k >= i; k--) {
      ans.push_back({k + 1, k + 2});
      swap(b[k], b[k + 1]);
    }
  }
  cout << ans.size() << "\n";
  for (auto p : ans) cout << p.first << " " << p.second << "\n";
}