import sys
from math import log

def debug(x, table):
    for name, val in table.items():
        if x is val:
            print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)
            return None

def solve():
    N, K, X = map(int, input().split())
    start = list(range(1, N + 1))
    zenhan = []
    kouhan = []

    for i in range(X - 1):
        A, B = map(int, input().split())
        zenhan.append((A, B))

    input()

    for i in range(K - X):
        A, B = map(int, input().split())
        kouhan.append((A, B))

    kouhan.reverse()

    end = [int(i) for i in input().split()]

    for i in range(X - 1):
        A, B = zenhan[i]
        start[A - 1], start[B - 1] = start[B - 1], start[A - 1]

    for i in range(K - X):
        A, B = kouhan[i]
        end[A - 1], end[B - 1] = end[B - 1], end[A - 1]

    # debug(start, locals())
    # debug(end, locals())

    ans = []

    for i in range(N):
        if start[i] != end[i]:
            ans.append(i + 1)
            
    print(*ans)

    pass

if __name__ == '__main__':
    solve()