#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
using namespace std;
template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
template<class T> istream& operator , (istream& is, T& val){ return is >> val;}
template<class T> ostream& operator << (ostream& os, vector<T>& vec){for(int i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"\n":" ");return os;}

#include <cassert>

int main(){
	int n,k;
	cin >> n >> k;
	vector<int> x(k),y(k);
	for(int i=0; i<k; i++){
		cin >> x[i] >> y[i];
		x[i]--;
		y[i]--;
	}
	vector<int> a_(n);
	cin >> a_;

	vector<int> b(n);
	iota(b.begin(), b.end(), 0);

	for(int i=0; i<k; i++){
		swap(b[x[i]], b[y[i]]);
	}
	vector<int> d(n);

	vector<int> a(n);
	for(int i=0; i<n; i++){
		d[b[i]] = i;
		//a[i]--;
		a_[i]--;
		a[a_[i]]=i;
	}

	vector<int> p,q;
	for(int i=0; i<n; i++){
		while(b[i] != a[i]){
			int u = d[a[i]];
			int v = u-1;
			p.push_back(v);
			q.push_back(u);
			swap(b[u], b[v]);
			d[b[v]] = v;
			d[b[u]] = u;
		}
	}
	assert(0<=p.size());
	assert(p.size() <= 6000);

	cout << p.size() << endl;
	for(int i=0; i<p.size(); i++){
		
		assert(p[i]+1 == q[i]);
		assert(1<=p[i]+1);
		assert(q[i]+1<=n);

		cout << p[i]+1 << " " << q[i]+1 << endl;
	}

	return 0;
}