#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n) - 1; i >= 0; i--)
#define range(a) a.begin(), a.end()

int index(vector<int> a, int b) {
    return find(range(a), b) - a.begin();
}

void answer(vector<int> a) {
    rep(i, a.size()) cout << a[i] << " \n"[i == a.size() - 1];
    exit(0);
}

void fail() {
    cout << -1 << endl;
    exit(0);
}

int main() {
    int N, P, Q; cin >> N >> P >> Q;
    vector<int> A(N); rep(i, N) cin >> A[i];
    if (not next_permutation(range(A))) fail();
    int p = index(A, P);
    int q = index(A, Q);
    if (p < q) answer(A);
    if (P < Q) {
        sort(A.begin() + q + 1, A.end(), greater<>());
        if (not next_permutation(range(A))) fail();
        answer(A);
    } else {
        sort(A.begin() + q + 1, A.end(), greater<>());
        if (not next_permutation(range(A))) fail();
        p = index(A, P);
        q = index(A, Q);
        if (p < q) answer(A);
        while (q < p) {
            swap(A[q], A[q + 1]);
            q++;
        }
        answer(A);
    }
}