#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cerr << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cerr<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = (1 << 30) - 1;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; //use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////

int N, L, R;
int A[MAX_N];
int B[MAX_N];
set<int> S;


void solve() {
	cin >> N >> L >> R; L--; R--;
	rep(i, 0, N) {
		cin >> A[i];
		A[i]--;
	}
	memset(B, -1, sizeof(B));
	rep(i, 0, N) S.insert(i);
	int at = -1;
	rep(i, 0, N - 1) {
		auto it = S.end(); it--;
		int maxv = *it; it--;
		int smaxv = *it;
		if(A[i] != maxv && R != maxv) {
			at = i;
		}
		else if(A[i] == maxv && R == maxv) {
			break;
		}
		else if(A[i] == maxv && R != maxv) {
		}
		else {
			if(A[i] != smaxv) {
				at = i;
			}
		}
		S.erase(A[i]);
		if(R == A[i] && S.count(L)) {
			break;
		}
	}
	if(at == -1) {
		cout << -1 << "\n"; return;
	}
	S.clear();
	rep(i, 0, N) S.insert(i);
	rep(i, 0, at) {
		S.erase(A[i]);
		B[i] = A[i];
	}
	auto it = S.upper_bound(A[at]);
	if(*it == R) {
		it++; B[at] = *it;
		S.erase(it);
	}
	else {
		B[at] = *it;
		S.erase(it);
	}
	bool reverse = S.count(L) && L > R;
	if(reverse) S.erase(R);
	int i = at + 1;
	while(i < N) {
		B[i] = *S.begin();
		S.erase(S.begin());
		if(B[i] == L && reverse) {
			i++; B[i] = R;
		}
		i++;
	}
	rep(i, 0, N) {
		cout << B[i] + 1 << " ";
	}
	cout << "\n";
}

uint32_t rd() {
	uint32_t res;
#ifdef __MINGW32__
	asm volatile("rdrand %0" :"=a"(res) ::"cc");
#else
	res = std::random_device()();
#endif
	return res;
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
    cerr << fixed;
	cerr.precision(6);
	rng.seed(rd());
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
	if(!freopen("in.txt", "rt", stdin)) return 1;
#endif	
	solve();
    cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
	return 0;
}