def next_permutation(P):
    n = len(P)
    for i in range(n - 2, -1, -1):
        if P[i] < P[i + 1]:
            l = i + 1
            r = n - 1
            while r > l:
                P[l], P[r] = P[r], P[l]
                l += 1
                r -= 1
            for j in range(i + 1, n):
                if P[i] < P[j]:
                    P[i], P[j] = P[j], P[i]
                    return True
    return False


def all_permutations(P):
    # 全列挙したい場合はソートしてある状態で渡す
    yield P
    while next_permutation(P):
        yield P


def prev_permutation(P):
    n = len(P)
    for i in range(n - 2, -1, -1):
        if P[i] > P[i + 1]:
            l = i + 1
            r = n - 1
            while r > l:
                P[l], P[r] = P[r], P[l]
                l += 1
                r -= 1
            for j in range(i + 1, n):
                if P[i] > P[j]:
                    P[i], P[j] = P[j], P[i]
                    return True
    return False


def rev_all_permutations(P):
    # 全列挙したい場合は逆順ソートしてある状態で渡す
    yield P
    while prev_permutation(P):
        yield P


n, p, q = map(int, input().split())
A = list(map(int, input().split()))
if not next_permutation(A):
    print(-1)
    exit()


pp = -1
qq = -1
for i, a in enumerate(A):
    if a == p:
        pp = i
    if a == q:
        qq = i

if pp < qq:
    print(*A)
    exit()

if q < p:
    B = A[qq:]
    A = A[:qq]
    mi = 1 << 30
    for b in B:
        if b > q and b < mi:
            mi = b

    A.append(mi)
    B.remove(mi)
    B.sort()
    if mi == p:
        A += B
    else:
        for b in B:
            if b == q:
                pass
            elif b == p:
                A += [p, q]
            else:
                A.append(b)

    print(*A)
else:
    ma = -1
    ind = -1
    for i in range(n - 1, -1, -1):
        if A[i] > ma and A[i] != q:
            ma = A[i]
        if i <= qq and ma > A[i]:
            ind = i
            break

    if ind == -1:
        print(-1)
        exit()

    B = A[ind:]
    A = A[:ind]

    mi = 1 << 30
    for b in B:
        if b > B[0] and b != q and b < mi:
            mi = b

    A.append(mi)
    B.remove(mi)
    B.sort()
    A += B
    print(*A)