#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

int main() {
	int N, K; cin >> N >> K;
	vector<int> a(N);
	for (int i = 0; i < N; i++)
		a[i] = i;
	while (K--) {
		int X, Y; cin >> X >> Y;
		X--; Y--;
		swap(a[X], a[Y]);
	}
	vector<int> A(N);
	for (int i = 0; i < N; i++) {
		cin >> A[i];
		A[i]--;
	}
	vector<int> p(N);
	for (int i = 0; i < N; i++)
		p[A[i]] = i;
	for (int i = 0; i < N; i++)
		for (int j = 0; j < N; j++)
			if (p[j] == a[i]) {
				a[i] = j;
				break;
			}
	vector<int> x, y;
	for (;;) {
		bool ok = true;
		for (int i = 0; i + 1 < N; i++)
			if (a[i] > a[i + 1]) {
				ok = false;
				x.push_back(i);
				y.push_back(i + 1);
				swap(a[i], a[i + 1]);
			}
		if (ok) break;
	}
	cout << x.size() << endl;
	for (int i = 0; i < x.size(); i++)
		cout << x[i] + 1 << ' ' << y[i] + 1 << endl;
}