N = int(input())
K = int(input())
XY = [tuple(map(int, input().split())) for _ in range(K)]
XY = list(map(lambda k: (k[0]-1, k[1]-1), XY))
A = list(map(int, input().split()))
A = list(map(lambda k: k-1, A))

mid_state = [0] * N

for i in range(N):
    pos = i
    
    for j in range(K):
        if pos == XY[j][0]:
            pos = XY[j][1]
        elif pos == XY[j][1]:
            pos = XY[j][0]
    
    mid_state[pos] = i

last_state = [0] * N

for i in range(N):
    last_state[A[i]] = i

ans = []

for i in range(N):
    for j in range(N):
        if mid_state[j] == last_state[i]:
            for k in range(j, i, -1):
                ans.append((k-1, k))
            
            mid_state.insert(0, mid_state.pop(j))
            break

print(len(ans))

for Xi, Yi in ans:
    print(Xi+1, Yi+1)