#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
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;}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int n,p,q;cin>>n>>p>>q;p--,q--;
    vector<int> a(n);
    rep(i,n){
        cin>>a[i];a[i]--;
    }

    if(!next_permutation(ALL(a))){
        cout<<-1<<endl;
        return 0;
    }

    bool f=false;
    bool pf=false;
    vector<int> ans(n);
    set<int> st;rep(i,n)st.insert(i);

    rep(i,n){
        if(f){
            auto ite=st.begin();
            if(*ite==q and !pf){
                ite=next(ite);
                if(ite==st.end()){
                    cout<<-1<<endl;
                    return 0;
                }
                ans[i]=*ite;
                if(*ite==p) pf=true;
            }
            else if(*ite==p){
                ans[i]=*ite;
                pf=true;
            }
            else{
                ans[i]=*ite;
            }
            st.erase(ite);
        }else{
            if(a[i]==q and !pf){
                auto ite=st.lower_bound(a[i]+1);
                if(ite==st.end()){
                    cout<<-1<<endl;
                    return 0;
                }
                ans[i]=*ite;
                st.erase(ite);
                f=true;
            }
            else if(a[i]==p){
                ans[i]=a[i];
                pf=true;
                st.erase(a[i]);
            }
            else{
                ans[i]=a[i];
                st.erase(a[i]);
            }
        }
    }
    rep(i,n) cout<<ans[i]+1<<(i+1==n?"\n":" ");
    return 0;
}