#include <iostream>
#include <vector>
using namespace std;

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

	vector<int> l(n);
	for (int i = 0; i < n; i++)
		l[i] = i;

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

	vector<int> result;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j + 1 < n - i; j++) {
			if (a[l[j]] > a[l[j + 1]]) {
				result.emplace_back(j + 1);
				swap(l[j], l[j + 1]);
			}
		}
	}

	cout << result.size() << endl;
	for (auto no : result) 
		cout << no << " " << no + 1 << endl;

	return 0;
}