import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = (1 << 63)-1
inf = (1 << 31)-1
md = 10**9+7
# md = 998244353

n, p, q = LI()
aa = LI()

ismax = [0]*n
mx = -1
fp = fq = False
t = n-1
for i in range(n)[::-1]:
    a = aa[i]
    if a == p:
        fp = True
    if a == q:
        fq = True
        if fp: t = i
    if fp:
        if a > mx:
            ismax[i] = 1
            if a != q: mx = a
    elif fq:
        if a > mx and a > q:
            ismax[i] = 1
            if a != q: mx = a
    else:
        if a > mx:
            ismax[i] = 1
            if a != q: mx = a
# pDB(t, ismax)

while t >= 0 and ismax[t]: t -= 1

if t < 0:
    print(-1)
    exit()

ans = aa[:t]
pos = []
fp = fq = False
for i in range(t, n):
    a = aa[i]
    if a == q:
        fq = True
        continue
    if a == p:
        fp = True
    pos.append(a)

if not fp and fq:
    pos.append(q)
    fq = False

pos.sort(reverse=True)
for i in range(len(pos))[::-1]:
    if pos[i] > aa[t]:
        if pos[i] == p: fp = False
        ans.append(pos.pop(i))
        break

while pos:
    ans.append(pos.pop())
    if ans[-1] == p and fq:
        pos.append(q)
        pos.sort(reverse=True)

print(*ans)