#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#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; }


void solve();

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

void solve() {
  int n, p, q;
  cin >> n >> p >> q;
  vector<int> a(n);
  cin >> a;

  int c = 0;
  do {
    if (c == 1) break;
    c++;
  } while (next_permutation(all(a)));
  map<int, int> mp;
  rep(i, n) mp[a[i]] = i;
  if (mp[p] < mp[q]) {
    cout << a << endl;
    return;
  }
  if (q == n && mp[q] == 0) { // sample 3
    cout << -1 << endl;
    return;
  }

  vector<int> b;
  int p_ = 0; // もう p 入った
  int fr = 0; // 自由
  set<int> s;
  rep3(i, 1, n + 1) s.insert(i);

  rep(i, n) {
    if (fr) {
      vector<int> c;
      if (p_) {
        for (int e : s) c.eb(e);
        sort(all(c));
      } else {
        for (int e : s) if (e != p && e != q) c.eb(e);
        sort(all(c));
        int it = lb(c, p);
        c.insert(c.begin() + it, p);
        c.insert(c.begin() + it + 1, q);
      }
      rep(i, sz(c)) b.eb(c[i]);
      cout << b << endl;
      return;
    } else {
      auto it = s.lower_bound(a[i]);
      if (p_ == 0 && *it == q) it++;
      if (it == s.end()) {
        cout << -1 << endl;
        return;
      }
      b.eb(*it);
      s.erase(*it);
      if (*it == p) p_ = 1;
      fr++;
    }
  }
  cout << b << endl;
}