#include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for(int i = 0; i < (n); i++)
#define MEM(a, x) memset(a, x, sizeof(a))
#define ALL(a) a.begin(), a.end()
#define UNIQUE(a) a.erase(unique(ALL(a)), a.end())
typedef long long ll;
typedef pair<int, int> P;

int n, k, c[105];

int main(int argc, char const *argv[]) {
	ios_base::sync_with_stdio(false);
	cin >> n >> k;
	vector<int> a(n), b(n);
	FOR(i, n) {
		a[i] = i; // the line point_i is on
		b[i] = i; // the point on line_i
	}
	FOR(i, k) {
		int x, y;
		cin >> x >> y;
		x--;
		y--;
		int p1 = b[x], p2 = b[y];
		a[p1] = y;
		a[p2] = x;
		b[x] = p2;
		b[y] = p1;
	}
	FOR(i, n) {
		int x;
		cin >> x;
		c[x-1] = i;
	}
	vector<int> d(n);
	FOR(i, n) d[i] = b[i];
	vector<P> v;
	FOR(i, n) {
		int p1 = d[i];
		while (a[p1] < c[p1]) {
			v.push_back({a[p1], a[p1]+1});
			int p2 = b[a[p1]+1], l1 = a[p1], l2 = a[p2];
			a[p2] = l1;
			a[p1] = l2;
			b[l1] = p2;
			b[l2] = p1;
		}
		while (c[p1] < a[p1]) {
			v.push_back({a[p1]-1, a[p1]});
			int p2 = b[a[p1]-1], l1 = a[p1], l2 = a[p2];
			a[p2] = l1;
			a[p1] = l2;
			b[l1] = p2;
			b[l2] = p1;
		}
	}
	cout << v.size() << endl;
	FOR(i, v.size()) {
		cout << v[i].first+1 << " " << v[i].second+1 << endl;
	}
	return 0;
}