// yukicoder 326 (http://yukicoder.me/problems/905)
#include<cstdio>
#include<algorithm>
#include<numeric>
#include<vector>
#define rep(i,a) for(int i=0;i<(a);++i)

typedef std::pair<int, int> P;

const int MAX_K = 6000, MAX_N = 100;

int N, K;

int ord[MAX_N], f[MAX_N+1];

std::vector<P> ps;

int main()
{
	scanf( "%d%d", &N, &K );

	std::iota( ord, ord+N, 1 );

	rep( i, K )
	{
		int X, Y;
		scanf( "%d%d", &X, &Y );

		std::swap( ord[X-1], ord[Y-1] );
	}
	rep( i, N )
	{
		int A;
		scanf( "%d", &A );
		f[i+1] = A;
	}
	rep( i, N )
		ord[i] = f[ord[i]];

	bool upd = true;

	while( upd )
	{
		upd = false;

		rep( i, N-1 )
		{
			if( ord[i] > ord[i+1] )
			{
				std::swap( ord[i], ord[i+1] );
				ps.push_back( P( i+1, i+2 ) );
				
				upd = true;
			}
		}
	}

	printf( "%d\n", ps.size() );
	rep( i, ps.size() )
		printf( "%d %d\n", ps[i].first, ps[i].second );

	return 0;
}