#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;

ll N,M,H,W,Q,K,A,B;
string S;
const ll MOD = 998244353;
//const ll MOD = (1e+9) + 7;
typedef pair<ll, ll> P;
const ll INF = (1LL<<60);

int main() {
    ll p, q;
    cin>>N>>p>>q;
    vec a(N);
    rep(i,N) cin>>a[i];
    if(!next_permutation(ALL(a))){
        cout<<-1<<endl;
        return 0;
    }
    int id = 0;
    bool flag = false;
    rep(i,N){
        if(a[i] == p) flag = true;
        if(flag && a[i] == q){
            rep(j,N){
                cout<<a[i];
                j == N - 1 ? cout<<endl : cout<<' ';
            }
            return 0;
        }
        if(a[i] == q){id = i; break;}
    }
    vec ans(N);
    set<ll> s;
    rep(i,N) s.insert(i+1);
    rep(i,id) s.erase(a[i]);
    s.erase(q);
    while(id >= 0){
        if(s.upper_bound(a[id--]) != s.end()){
            ++id;
            int temp = *s.upper_bound(a[id]);
            rep(i,id) ans[i] = a[i];
            s.insert(a[id]);
            ans[id++] = temp;
            s.erase(temp);
            s.insert(q);
            //cout<<id<<' '<<s.size()<<endl;
            for(ll t : s){
                if(p < q){
                    ans[id++] = t;
                }else{
                    if(t != q) ans[id++] = t;
                    if(t == p) ans[id++] = q;
                }
            }
            rep(i,N){cout<<ans[i]; i == N - 1 ? cout<<endl : cout<<' ';}
            return 0;
        }else{
            if(id != 0) s.insert(a[id]);
        }
    }
    cout<<-1<<endl;
}