mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline

    class Bit:
        def __init__(self, n):
            self.size = n
            self.tree = [0] * (n + 1)

        def sum(self, i):
            s = 0
            while i > 0:
                s += self.tree[i]
                i -= i & -i
            return s

        def add(self, i, x):
            while i <= self.size:
                self.tree[i] += x
                i += i & -i

        def lower_bound(self, w):
            if w <= 0:
                return 0
            x = 0
            k = 1 << (self.size.bit_length() - 1)
            while k:
                if x + k <= self.size and self.tree[x + k] < w:
                    w -= self.tree[x + k]
                    x += k
                k >>= 1
            return x + 1

    N, P, Q = map(int, input().split())
    A = list(map(int, input().split()))

    # increment
    j = N-1
    prev = 0
    bit = Bit(N+1)
    tmp = []
    while True:
        bit.add(A[j], 1)
        tmp.append(A[j])
        if A[j] > prev:
            prev = A[j]
            j -= 1
        else:
            break
        if j == -1:
            print(-1)
            exit()
    k = bit.lower_bound(bit.sum(A[j]) + 1)
    A[j] = k
    tmp.remove(k)
    tmp.sort()
    for jj in range(j+1, N):
        A[jj] = tmp[jj-j-1]

    for i, a in enumerate(A):
        if a == P:
            ip = i
        elif a == Q:
            iq = i
    if ip < iq:
        print(*A)
        exit()

    # iq change ok?
    bit = Bit(N)
    tmp = []
    for i in range(N-1, iq-1, -1):
        bit.add(A[i], 1)
        tmp.append(A[i])
    R = bit.lower_bound(bit.sum(Q) + 1)
    if R < N+1:
        A[iq] = R
        tmp.remove(R)
        if P > Q:
            tmp.remove(Q)
            tmp.append(P+0.5)
        tmp.sort()
        for i in range(iq+1, N):
            a = tmp[i-iq-1]
            if a == P+0.5:
                a = Q
            A[i] = a
        print(*A)
        exit()

    # iq change ng
    for i in range(iq-1, -1, -1):
        a = A[i]
        bit.add(a, 1)
        tmp.append(a)
        R = bit.lower_bound(bit.sum(a) + 1)
        if R >= Q:
            continue

        A[i] = R
        tmp.remove(R)
        if P > Q:
            tmp.remove(Q)
            tmp.append(P + 0.5)
        tmp.sort()
        for ii in range(i + 1, N):
            a = tmp[ii - i - 1]
            if a == P + 0.5:
                a = Q
            A[ii] = a
        print(*A)
        exit()

    print(-1)


if __name__ == '__main__':
    main()