#include <iostream>
#include <queue>
#include <map>
#include <list>
#include <vector>
#include <string>
#include <limits>
#include <cassert>
#include <fstream>
#include <cstring>
#include <bitset>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <cstdio>
#include <ciso646>
#include <array>

using namespace std;

#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)

#define inf 0x3f3f3f3f
#define CLEAR(a) a = decltype(a)()
#define MP make_pair
#define ALL(a) (a).begin(),(a).end()
#define pii pair<int ,int>
#define pcc pair<char,char>
#define pic pair<int,char>
#define pci pair<char,int>
#define VS vector<string>
#define VI vector<int>
#define VVI vector<vector<int>>
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define pi 2*acos(0.0)
#define INFILE() freopen("in.txt","r",stdin)
#define OUTFILE() freopen("out.txt","w",stdout)
#define ll long long
#define ull unsigned long long
#define eps 1e-14
#define FIN std::ifstream cin("D:\input.txt")

vector<int> dp;
vector<int> cost;

int main(void) {
	int N, K; cin >> N >> K;
	vector<int> l(N);
	vector<pii> xy(K);
	for (auto &a : xy) {
		cin >> a.first >> a.second;
		a.first--; a.second--;
	}
	for (auto &a : l) {
		cin >> a;
		--a;
	}
	for (auto &a : xy) { 
		swap(l[a.first], l[a.second]);
	}

	vector<int> res;
	REP(i, l.size()) {
		REP(j, l.size()-1) {
			if (l[j] > l[j + 1]) {
				res.push_back(j);
				swap(l[j], l[j + 1]);
			}
		}
	}

	cout << res.size() << endl;
	for (int a : res) {
		cout << a+1 << " " << a + 2 << endl;
	}
	cout << endl;
	return 0;
}