#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define endl '\n'
const int inf = 1000000007;
const ll INF = 1e18;
// int mod = 998244353;
int mod = 1000000007;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return 1; } return 0; }
ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template<typename T, typename U> T pow_(T a, U b) { return b ? pow_(a * a, b / 2) * (b % 2 ? a : 1) : 1; }
ll modpow(ll a, ll b, ll _mod) { return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1; }
template<class T, class U> ostream& operator << (ostream& os, const pair<T, U>& p) { os << p.F << " " << p.S; return os; }
template<class T> ostream& operator << (ostream& os, const vector<T>& vec) { rep(i, sz(vec)) { if (i) os << " "; os << vec[i]; } return os; }
template<typename T> inline istream& operator >> (istream& is, vector<T>& v) { rep(j, sz(v)) is >> v[j]; return is; }
template<class T, class T2> inline void add(T &a, T2 b) { a += b; if (a >= mod) a -= mod; }
template<class T> void operator += (vector<T>& v, vector<T> v2) { rep(i, sz(v2)) v.eb(v2[i]); }

void solve();

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(11);
  int T;
  T = 1;
  while (T--) solve();
}

// https://betrue12.hateblo.jp/entry/2020/05/09/001843
void solve() {
  int n;
  cin >> n;
  int p, q;
  cin >> p >> q;
  vector<int> a(n);
  cin >> a;

  // 降順
  // next_permutaion したら小さくなる
  auto check = [&]() {
    rep(i, n) {
      if (a[i] != n - i) return;
    }
    rep(i, n) {
      if (a[i] == q) { cout << -1 << endl; exit(0); }
      if (a[i] == p) { cout << a << endl; exit(0); }
    }
    return;
  };
  auto manu = [&]() {
    // 1 つ大きくする
    int c = 0;
    do {
      if (c++ == 1) break;
    } while (next_permutation(all(a)));
    // cerr << l << "  " << a << endl;

    // p が q の手前か
    rep(i, n) {
      if (a[i] == q) return;
      if (a[i] == p) { cout << a << endl; exit(0); }
    }
  };
  rep(l, n) {
    check();
    manu();

    // 少なくとも先頭から q までの並びが崩れないと
    // q の後ろを降順にして 1 つ進める
    vector<int> v, v2;
    int flg = 0;
    rep(i, n) {
      if (flg == 0) v.eb(a[i]);
      else v2.eb(a[i]);

      if (a[i] == q) flg = 1;
    }
    sort(all(v2), greater<int>());
    v += v2;
    a = v;
    check();
    manu();

    // p が q の後ろ, p の方が大きい
    // p の直後に q を持ってくる
    if (p > q) {
      v.clear();
      rep(i, n) {
        if (a[i] == q) continue;
        v.eb(a[i]);
        if (a[i] == p) v.eb(q);
      }
      cout << v << endl;
      return;
    }

    int id = -1, id2 = -1;
    rep(i, n) if (a[i] == q) id = i;
    for (int i = id - 1; i >= 0; --i) {
      if (a[i] < a[i + 1]) {
        id2 = i;
        break;
      }
    }
    swap(a[id], a[id2]);
  }
}