#include <bits/stdc++.h>
#define GET_MACRO(a, b, c, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define rep2(i, a) rep3 (i, 0, a)
#define rep3(i, a, b) for (int i = (a); i < (b); i++)
#define repr(...) GET_MACRO(__VA_ARGS__, repr3, repr2)(__VA_ARGS__)
#define repr2(i, a) repr3 (i, 0, a)
#define repr3(i, a, b) for (int i = (b) - 1; i >= (a); i--)
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
using namespace std;
typedef long long ll;

int main() {
	int n, k;
	cin >> n >> k;
	vector<int> a(n);
	rep (i, n) a[i] = i;
	rep (i, k) {
		int x, y;
		cin >> x >> y;
		x--; y--;
		swap(a[x], a[y]);
	}
	auto b = a;
	vector<int> A(n);
	rep (i, n) cin >> A[i], A[i]--;
	rep (i, n) a[i] = A[b[i]];
	vector<pair<int, int>> ans;
	rep (i, n) {
		repr (j, i, n - 1) {
			if (a[j] > a[j + 1]) {
				ans.emplace_back(j, j + 1);
				swap(a[j], a[j + 1]);
			}
		}
	}
	cout << ans.size() << endl;
	rep (i, ans.size()) {
		cout << ans[i].first + 1 << " " << ans[i].second + 1 << endl;
	}
	return 0;
}