#include <bits/stdc++.h>

using namespace std;

#define REP(i, n) for (int i=0; i<(n); ++i)
#define RREP(i, n) for (int i=(int)(n)-1; i>=0; --i)
#define FOR(i, a, n) for (int i=(a); i<(n); ++i)
#define RFOR(i, a, n) for (int i=(int)(n)-1; i>=(a); --i)

#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()

#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl
#define DEBUG(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<<endl;

template<class T>
ostream &operator<<(ostream &os, const vector <T> &v) {
    os << "[";
    REP(i, SZ(v)) {
        if (i) os << ", ";
        os << v[i];
    }
    return os << "]";
}

template<class T, class U>
ostream &operator<<(ostream &os, const pair <T, U> &p) {
    return os << "(" << p.first << " " << p.second << ")";
}

template<class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vi>;
using vvll = vector<vll>;

const ll MOD = 1e9 + 7;
const int INF = INT_MAX / 2;
const ll LINF = LLONG_MAX / 2;
const ld eps = 1e-9;


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    // ifstream in("in.txt");
    // cin.rdbuf(in.rdbuf());

    int N, P, Q;
    cin >> N >> P >> Q;
    vi A(N);
    REP(i, N) cin >> A[i];

    // TODO 存在しない場合
    if (!next_permutation(ALL(A))) {
        cout << -1 << endl;
        return 0;
    }

    int pi, qi;
    REP(i, N) {
        if (A[i] == P) pi = i;
        if (A[i] == Q) qi = i;
    }

    if (pi < qi) {
        REP(i, N) {
            if (i) cout << ' ';
            cout << A[i];
        }
        cout << endl;
        return 0;
    }

    if (P < Q) {
        int mi = N;
        FOR(i, qi+1, N) {
            if (Q < A[i]) {
                chmin(mi, A[i]);
            }
        }
        if (mi == N) {
            cout << -1 << endl;
            return 0;
        }
        vi ans;
        REP(i, qi) ans.push_back(A[i]);
        ans.push_back(mi);

        set<int> st;
        FOR(i, qi, N) {
            if (A[i] == mi) continue;
            st.insert(A[i]);
        }
        for (int a : st) ans.push_back(a);

        REP(i, N) {
            if (i) cout << ' ';
            cout << ans[i];
        }
        cout << endl;
        return 0;
    }

    vi ans;
    REP(i, qi) {
        ans.push_back(A[i]);
    }
    set<int> st;
    FOR(i, qi, N) {
        st.insert(A[i]);
    }

    bool valid = false;
    while (st.upper_bound(Q) != st.end()) {
        int a = *st.upper_bound(Q);
        ans.push_back(a);
        st.erase(a);
        if (a == P) {
            valid = true;
            break;
        }
        for (auto it = st.begin(); it != st.end();) {
            if (*it == Q) {
                break;
            }
            else {
                ans.push_back(*it);
                it = st.erase(it);
            }
        }
    }

    if (!valid) {
        cout << -1 << endl;
        return 0;
    }

    for (int a : st) ans.push_back(a);

    REP(i, N) {
        if (i) cout << ' ';
        cout << ans[i];
    }
    cout << endl;

    return 0;
}