#include "bits/stdc++.h"
#include <unordered_set>

#define _CRT_SECURE_NO_WARNINGS

#define FOR(i, x, n) for(decltype(x) i = (x); i < (n); i++)
#define REP(i, n) for(decltype(n) i = 0; i < (n); i++)
#define RREP(i, n) for (decltype(n) i = (n) - 1; i >= 0; i--)

#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())

using namespace std;

const int dy[] = { 0, 1, 0, -1 };
const int dx[] = { 1, 0, -1, 0 };

using LL = long long int;
using LD = long double;

const int INF = (1 << 30) - 1;
const LL INF64 = ((LL)1 << 62) - 1;
const double PI = 3.1415926535897932384626433832795;

using pii = pair<int, int>;
using pll = pair<LL, LL>;
using pdd = pair<double, double>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<LL>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vb>;

int n, k;
vi goal, A;

void input() {
	cin >> n >> k;

	REP(i, n) goal.push_back(i);
	REP(i, k) {
		int x, y;
		cin >> x >> y; x--; y--;
		swap(goal[x], goal[y]);
	}

	REP(i, n) {
		int t; cin >> t; t--;
		A.push_back(t);
	}
}

void solve() {
	vector<pii> ans;

	REP(i, n) {
		for (int j = 0; j + 1 < n; j++) {
			if (A[goal[j]] > A[goal[j + 1]]) {
				ans.push_back(make_pair(j, j + 1));
				swap(goal[j], goal[j + 1]);
			}
		}
	}

	cout << ans.size() << endl;
	REP(i, ans.size()) {
		cout << ans[i].first + 1 << " " << ans[i].second + 1 << endl;
	}

}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	input();
	solve();
	return 0;
}