#include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <string>
#include <tuple>
#include <functional>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <map>
#include <random>
//#include "toollib.h"
#define INT_MAX 2147483647
#define Loop(i, n) for(int i = 0; i < (int)n; i++)
#pragma warning (disable:4018)

using namespace std;
typedef long long int lint;

//***** Main Program *****
int main() {
	int N, K;
	cin >> N >> K;
	vector<int> X(K), Y(K);
	Loop(i, K) cin >> X[i] >> Y[i];
	vector<int> A(N);
	Loop(i, N) cin >> A[i];
	
	map<int, int> amida;
	Loop(i, N) amida[i + 1] = i;
	Loop(i, K) {
		int pass = amida[X[i]];
		amida[X[i]] = amida[Y[i]];
		amida[Y[i]] = pass;
	}
	vector<pair<int, int>> ret;
	Loop(i, N) {
		if (A[amida[i + 1]] != i + 1) {
			Loop(k, N) {
				if (A[k] == i + 1) {
					Loop(kk, N) {
						if (amida[kk + 1] == k) {
							int j = kk + 1;
							while (j > i + 1) {
								ret.push_back({ j - 1,j });
								int pass = amida[j];
								amida[j] = amida[j - 1];
								amida[j - 1] = pass;
								j--;
							}
							break;
						}
					}
					break;
				}
			}
		}
	}
	cout << ret.size() << endl;
	Loop(i, ret.size()) cout << ret[i].first << " " << ret[i].second << endl;
	return 0;
}