#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
const ll MOD=1e9+7;

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
  int x,y,n,t;
  cin>>n>>t;
  vector<int> a(n);
  iota(all(a),1);
  rep(i,t){
    cin>>x>>y; --x; --y;
    swap(a[x],a[y]);
  }
  vector<int> b(n);
  int tmp;
  rep(i,n){
    cin>>tmp;
    b[tmp-1]=i+1;
  }
  //cout<<a;
  vector<pii> re;
  rep(i,n){
    rep(j,n) if(a[j]==b[i]){
      for(int k=j;k>i;--k){
	re.eb(k-1,k);
	swap(a[k-1],a[k]);
	//cout<<k-1<<endl<<a;
      }
      break;
    }
  }
  //cout<<a<<b;
  cout<<re.size()<<endl;
  for(pii p:re) cout<<p.X+1<<" "<<p.Y+1<<endl;
  return 0;
}