#include "bits/stdc++.h"
using namespace std;
//諸機能
#pragma region MACRO
#define putans(x) cerr << "answer: "; cout << (x) << endl
#define dputans(x) cerr << "answer: "; cout << setprecision(10) << (double)(x) << endl
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define RREP(i,a,n) for(int i=(int)(a); i>= n; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define all(a) begin((a)),end((a))
#define FILL(a,n) for(auto &hoge : (a)) hoge = (n)
#define mp make_pair
#define exist(container, n) ((container).find((n)) != (container).end())
#define substr(s,i,l) string((s), (i), (l))
#define NPI_TO_RAD(x) (180.0*x/PI)
#define RAD_TO_NPI(x) (PI/180.0*x)
#pragma endregion
//デバッグなどの支援(多分完成版)
#pragma region CODING_SUPPORT
#define dbg1(var0) { std::cerr << ( #var0 ) << "=" << ( var0 ) << endl; }
#define dbg2(var0, var1) { std::cerr << ( #var0 ) << "=" << ( var0 ) << ", "; DEBUG1(var1); }
#define dbg3(var0, var1, var2) { std::cerr << ( #var0 ) << "=" << ( var0 ) << ", "; DEBUG2(var1, var2); }
#define dbg4(var0, var1, var2, var3) { std::cerr << ( #var0 ) << "=" << ( var0 ) << ", "; DEBUG3(var1, var2, var3); }
#ifndef _DEBUG //デバッグでないなら、計算時間短縮のためにエラー出力を無効化
#define dbg1 {}
#define dbg2 {}
#define dbg3 {}
#define dbg4 {}
#endif 
#pragma endregion 
//typedef（書き換える、書き足す可能性ある）
#pragma region TYPE_DEF
typedef long long ll; 
typedef pair<int,int> pii; typedef pair<string,string> pss;typedef pair<int,string>pis;typedef pair<string,int>psi;
typedef vector<string> vs; typedef vector<int> vi;
#pragma endregion
//諸々の定数(書き換える可能性ある)
#pragma region CONST_VAL
#define PI (2*acos(0.0))
#define EPS (1e-9)
#define MOD (int)(1e9 + 7)
#pragma endregion

int n, k;
int amida[101];
int ans[101];

void amidaswap(int x, int y)
{
	int a, b;
	REP(k, 1, n + 1)
	{
		if (amida[k] == x) a = k;
		if (amida[k] == y) b = k;
	}
	swap(amida[a], amida[b]);
}

int main()
{
	cin >> n >> k;
	rep(i, n+1)
	{
		amida[i] = i;
	}
	rep(i, k)
	{	
		int x, y; cin >> x >> y;
		amidaswap(x, y);
	}
	REP(i, 1, n + 1)cin >> ans[i];

	vector<pii> list;
	REP(i, 1, n + 1)
	{
		int ians = 1;
		REP(j, 1, n + 1)
		{
			if (ans[j] == i)
			{
				ians = j;
				break;
			}
		}

		int x = amida[ians];
		RREP(j, x, i+1)
		{
			list.push_back(mp(j - 1, j));
			amidaswap(j - 1, j);
		}

	}
	putans(list.size());
	for (auto a : list)
	{
		putans(to_string( a.first) + " " + to_string( a.second));
	}
	return 0;
}