/*
　　　∫ ∫ ∫
　　　ノヽ
　　（＿　 ）
　（＿　　　 ）
（＿＿＿＿＿＿ ）
　ヽ(´･ω･)ﾉ　
　　 |　 /
　　 UU
*/
#pragma region macro
#include <bits/stdc++.h>
typedef long long int64;
using namespace std;
typedef vector<int> vi;
const int MOD = (int)1e9 + 7;
const int64 INF = 1LL << 62;
const int inf = 1<<30;
const char bn = '\n';
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i,s,n) for (int i = s; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end() //コンテナじゃないと使えない!!
#define debug(x) cerr << #x << ": " << x << "\n";
#define mp make_pair
template <typename T>
ostream& operator<<(ostream& os, const vector<T> &V){
    int N = V.size();
    REP(i,N){
        os << V[i];
        if (i!=N-1) os << " ";
    }
    os << "\n";
    return os;
}
template <typename T,typename S>
ostream& operator<<(ostream& os, pair<T,S> const&P){
    os << "(";
    os << P.first;
    os << " , ";
    os << P.second;
    os << ")";
    return os;
}
template <typename T>
ostream& operator<<(ostream& os, set<T> &S){
    auto it=S.begin();
    while(it!=S.end()){
        os << *it;
        os << " ";
        it++;
    }
    os << "\n";
    return os;
}
template <typename T>
ostream& operator<<(ostream& os, deque<T> &q){
    for(auto it=q.begin();it<q.end();it++){
        os<<*it;
        os<<" ";
    }
    os<<endl;
    return os;
}
template <typename T,typename S>
ostream& operator<<(ostream& os, map<T,S> const&M){
    for(auto e:M){
        os<<e;
    }
    os<<endl;
    return os;
}
vector<pair<int,int>> dxdy = {mp(0,1),mp(1,0),mp(-1,0),mp(0,-1)};
#pragma endregion
//fixed<<setprecision(10)<<ans<<endl;



int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int N,P,Q; cin >> N >> P >> Q;
    vector<int> A(N);
    REP(i,N) cin >> A[i];

    vector<int> ans;
    vector<bool> remain(N,true);
    bool is_P = false;
    int idx = 0;
    REP(i,N){
        if(A[i]==P){
            is_P = true;
            idx = i;
            break;
        }else if(A[i]==Q) {idx=i;break;}
        remain[A[i]] = false;
        ans.emplace_back(A[i]);
    }
    
    vector<int > A_tails;
    int Am = A[idx];
    for(int i=idx;i<N;i++) A_tails.emplace_back(A[i]);
    if(is_P){
        
        if(next_permutation(ALL(A_tails))){
            if(find(ALL(A_tails),P)-A_tails.begin() < find(ALL(A_tails),Q)-A_tails.begin()){
                //ok!!
                for(auto a:A_tails) ans.emplace_back(a);
                cout << ans;
                return 0;
            }
        }else{
            cout << -1 << bn;
            return 0;
        }
    }

    sort(ALL(A_tails));
    bool ok = false;
    for(auto a:A_tails){
        if(Am < a){
            ans.emplace_back(a);
            A_tails.erase(find(ALL(A_tails),a));
            ok = true;
            break;
        }
    }
    if(not ok){
        cout << -1 << bn;
        return 0;
    }
    bool P_put = false, Q_wait = false;
    for(auto a:A_tails){
        if(a==Q){
            if(P_put) ans.emplace_back(a);
            else Q_wait = true;
        } else{
            ans.emplace_back(a);
            if(P==a){
                if(Q_wait) ans.emplace_back(Q);
                P_put = true;
            }
        }
    }




    cout << ans;
}