#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>

using namespace std;

int main() {
	int n, k;
	cin >> n >> k;
	vector<int> x(k);
	for (int i = 0; i < k; ++i) {
		cin >> x[i];
		--x[i];
		int y;
		cin >> y;
	}
	vector<int> a(n);
	for (int i = 0; i < n; ++i) {
		cin >> a[i];
		--a[i];
	}
	vector<int> starts(n);
	for (int i = 0; i < n; ++i) {
		starts[a[i]] = i;
	}
	vector<int> goals(n);
	for (int i = 0; i < n; ++i) {
		goals[i] = i;
	}
	for (int i = 0; i < k; ++i) {
		swap(goals[x[i]], goals[x[i] + 1]);
	}
	vector<int> resultX;
	for (int i = 0; i < n - 1; ++i) {
		int middle = distance(goals.begin(), find(goals.begin(), goals.end(), starts[i]));
		vector<int> newX;
		for (int k = middle - 1; k >= i; --k) {
			newX.push_back(k);
		}
		for (size_t k = 0; k < newX.size(); ++k) {
			swap(goals[newX[k]], goals[newX[k] + 1]);
		}
		resultX.insert(resultX.end(), newX.begin(), newX.end());
	}
	cout << resultX.size() << endl;
	for (size_t i = 0; i < resultX.size(); ++i) {
		cout << (resultX[i] + 1) << " " << (resultX[i] + 2) << endl;
	}
	return 0;
}