n, k, x = map(int, input().split())
X = []
Y = []
for i in range(k):
    a, b = map(str, input().split())
    if i+1 < x:
        a, b = int(a), int(b)
        a, b = a-1, b-1
        X.append((a, b))
    elif i+1 > x:
        a, b = int(a), int(b)
        a, b = a-1, b-1
        Y.append((a, b))
D = list(range(1, n+1))
C = list(map(int, input().split()))
for a, b in X:
    D[a], D[b] = D[b], D[a]
Y.reverse()
for a, b in Y:
    C[a], C[b] = C[b], C[a]
ans = []
for i in range(n):
    if C[i] != D[i]:
        ans.append(i+1)
print(*ans)