#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// namespace multiprecisioninteger = boost::multiprecision;
// using cint=multiprecisioninteger::cpp_int;
using namespace std;
using ll=long long;
#define double long double
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;
#define For(i,a,b) for(i=a;i<(ll)b;++i)
#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N,0)
#define brep1(i,N) bFor(i,N,1)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define endl "\n"
#define eb emplace_back
#define print(v) cout<<v<<endl
#define printyes cout<<"Yes"<<endl
#define printno cout<<"No"<<endl
#define printYES cout<<"YES"<<endl
#define printNO cout<<"NO"<<endl
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)

int main(){
  ll i,N,A,B,pa=0,pb=0;
  cin>>N>>A>>B;
  vec v(N);
  rep(i,N)cin>>v[i];
  if(!next_permutation(all(v))){
    print(-1);
    return 0;
  }
  rep(i,N){
    if(v[i]==A)pa=i;
    if(v[i]==B)pb=i;
  }
  if(pa<pb){
    output(v);
    return 0;
  }
  set<ll> se;
  set<ll>::iterator itr;
  while(--i>=0){
    se.insert(v[i]);
    if(i<=pb){
      itr=se.upper_bound(v[i]);
      if(itr!=se.end()&&*itr==B)++itr;
      if(itr!=se.end())break;
    }
  }
  if(i==-1){
    print(-1);
    return 0;
  }
  v[i]=*itr;
  se.erase(itr);
  itr=se.begin();
  if(A<B||v[i]==A){
    while(++i<N){
      v[i]=*itr;
      ++itr;
    }
  }else{
    while(++i<N){
      if(*itr==B)++itr;
      v[i]=*itr;
      if(*itr==A)v[++i]=B;
      ++itr;
    }
  }
  output(v);
}