#include <bits/stdc++.h>
using namespace std;
using LL = long long int;
#define incID(i, l, r) for(int i = (l)    ; i <  (r); ++i)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); --i)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); ++i)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); --i)
#define inc(i, n)  incID(i, 0, n)
#define dec(i, n)  decID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec1(i, n) decII(i, 1, n)
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define FI first
#define SE second
#define FR front()
#define BA back()
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
auto setmin   = [](auto & a, auto b) { return (b <  a ? a = b, true : false); };
auto setmax   = [](auto & a, auto b) { return (b >  a ? a = b, true : false); };
auto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };
auto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };
#define SI(v) static_cast<int>(v.size())
#define RF(e, v) for(auto & e: v)
#define until(e) while(! (e))
#define if_not(e) if(! (e))
#define ef else if
#define UR assert(false)
#define IN(T, ...) T __VA_ARGS__; IN_(__VA_ARGS__);
void IN_() { };
template<typename T, typename ... U> void IN_(T &  a, U &  ... b) { cin >> a; IN_(b ...); };
template<typename T                > void OUT(T && a            ) { cout << a << endl; }
template<typename T, typename ... U> void OUT(T && a, U && ... b) { cout << a << " "; OUT(b ...); }

// ---- ----

template<typename T> istream & operator>>(istream & s, vector<T> & v) { RF(e, v) { s >> e; } return s; }
template<typename T> ostream & operator<<(ostream & s, vector<T> const & v) {
	inc(i, SI(v)) { s << (i == 0 ? "" : " ") << v[i]; }
	return s;
}

int main() {
	IN(int, n, p, q);
	vector<int> a(n);
	cin >> a;
	
	auto ok = [&]() { OUT( a); exit(0); };
	auto ng = [&]() { OUT(-1); exit(0); };
	
	if_not(next_permutation(ALL(a))) { ng(); }
	int P = find(ALL(a), p) - a.begin();
	int Q = find(ALL(a), q) - a.begin();
	if(P < Q) { ok(); }
	
	set<int> se = { n + 1 };
	bool has_q = false;
	inc(i, n) {
		int x = a.BA; a.pop_back();
		if(x == q) { has_q = true; } else { se.insert(x); }
		int y = * se.upper_bound(x);
		if(has_q && y <= n) {
			se.erase(n + 1);
			se.erase(y);
			a.PB(y);
			if(se.count(p) == 0) { se.insert(q); }
			until(se.empty()) {
				int z = * se.begin();
				se.erase(z);
				a.PB(z);
				if(z == p) { se.insert(q); }
			}
			assert(SI(a) == n);
			ok();
		}
	}
	ng();
}