from itertools import *
from bisect import *
from math import *
from collections import *
from heapq import *
from random import *
import numpy as np
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
def MF(): return map(float, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LF(): return list(map(float, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

def main():
    def make_bar(now,goal):
        for i in range(now,goal,-1):
            ans.append([i,i+1])
            line[i-1],line[i]=line[i],line[i-1]

    n=II()
    k=II()
    line=list(range(n))
    for _ in range(k):
        x,y=MI1()
        line[x],line[y]=line[y],line[x]
    #print(line)
    ans=[]
    aa=LI1()
    for goal,start in enumerate(aa):
        now=line.index(start)
        make_bar(now,goal)
        #print(line)
    print(len(ans))
    for x in ans:
        print(*x)

main()