#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (int i=(int)from; i<(int)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }


int main() {
  ll N, P, Q; cin >> N >> P >> Q;
  ll A[N]; rep(i,N) cin >> A[i];
  ll pos[N+1] = {}; rep(i,N) pos[A[i]] = i;

  set<ll> used;
  vector<ll> result;
  per(i,N) {
    used.insert(A[i]);
    if ( (pos[P]<i&&pos[Q]>=i) || (pos[P]<i&&pos[Q]<i&&pos[P]<pos[Q]) ) {
      auto it = ++used.lower_bound(A[i]);
      if (it==used.end()) continue;
      rep(j,i) result.push_back(A[j]); result.push_back(*it);
      used.erase(it);
      for (auto x: used) result.push_back(x);
      debug(all(result));
      return 0;
    }
    else if ( (pos[P]>=i&&pos[Q]<i) || (pos[P]<i&&pos[Q]<i&&pos[P]>pos[Q]) ) continue;
    else {
      auto it = ++used.lower_bound(A[i]);
      if (it==used.end()) continue;
      rep(j,i) result.push_back(A[j]); result.push_back(*it);
      ll i1 = *it; used.erase(it);

      if (P<Q) for (auto x: used) result.push_back(x);
      else {
        if (i1==P) for (auto x: used) result.push_back(x);
        else {
          for (auto x: used) {
            if (x==P) { result.push_back(P); result.push_back(Q); }
            else if (x!=Q) result.push_back(x);
          }
        }
      }
      debug(all(result));
      return 0;
    }
  }
  cout << -1 << endl;
  return 0;
}