#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://yukicoder.me/problems/no/1051/editorial
void solve() {
  int n;
  cin >> n;
  int p, q;
  cin >> p >> q;
  vector<int> a(n);
  cin >> a;

  // a と先頭 i 文字目まで一致し, p が q の左
  int i_ = -1; // 可能な最大の i
  vector<int> ma(n + 1), ma2(n + 1);
  for (int i = n - 1; i >= 0; --i) {
    chmax(ma[i], ma[i + 1]);
    chmax(ma2[i], ma2[i + 1]);

    if (a[i] > ma[i + 1]) { ma2[i] = ma[i + 1]; ma[i] = a[i]; }
    else if (a[i] > ma2[i + 1]) { ma2[i] = a[i]; }
  }
  // cerr << ma << endl << ma2 << endl;

  int p_, q_;
  rep(i, n) { if (a[i] == p) p_ = i; else if (a[i] == q) q_ = i; }

  rep(i, n) {
    if ((p_ <= i && q_ <= i && p_ < q_) || (p_ <= i && q_ > i)) {
      if (a[i + 1] < ma[i + 1]) i_ = i;
    } else if ((p_ <= i && q_ <= i && q_ < p_) || (q_ <= i && p_ > i)) {

    } else if (p_ > i && q_ > i) {
      if (a[i + 1] < ma[i + 1]) i_ = i;
    }
  }
  cerr << "i_ " << i_ << endl;

  if ((p_ <= i_ && q_ <= i_ && p_ < q_) || (p_ <= i_ && q_ > i_)) {
    vector<int> b;
    rep(i, i_ + 1) b.eb(a[i]);
    int tmp = n + 1;
    rep3(i, i_ + 2, n) if (a[i] > a[i_ + 1]) chmin(tmp, a[i]);
    cerr << "tmp " << tmp << endl;
    if (tmp == n + 1) { cout << -1 << endl; return; }

    b.eb(tmp);
    vector<int> tmp_;
    rep3(i, i_ + 1, n) if (a[i] != tmp) tmp_.eb(a[i]);
    sort(all(tmp_));
    b += tmp_;
    cout << b << endl;
  } else if (p_ > i_ && q_ > i_) {
    int m = n + 1;
    cerr << "a " << a << "  " << i_ + 2 << endl;
    rep3(i, i_ + 2, n) if (a[i] > a[i_ + 1] && a[i] != q) chmin(m, a[i]);
    cerr << "m " << m << endl;
    if (m == n + 1) { cout << -1 << endl; return; }

    if (p < q || (p > q && m == p)) {
      vector<int> b;
      rep(i, i_ + 1) b.eb(a[i]);
      b.eb(m);
      vector<int> tmp_;
      rep3(i, i_ + 1, n) if (a[i] != m) tmp_.eb(a[i]);
      sort(all(tmp_));
      cerr << "tmp_ " << tmp_ << endl;
      b += tmp_;
      cout << b << endl;
    } else {
      if (m != p) {
        vector<int> b;
        b.eb(m);
        rep3(i, 1, p) if (i != q && i != m) b.eb(i);
        b.eb(p);
        b.eb(q);
        rep3(i, p + 1, n + 1) if (i != q && i != m) b.eb(i);
        cout << b << endl;
      }
    }
  }
}