#include <stdio.h>
#include <algorithm>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}


#include <string.h>
void solve_gu(int n, int l, int r, int *a) {
	int perm[n];
	memcpy(perm, a, sizeof(int) * n);
	while (std::next_permutation(perm, perm + n)) {
		if (std::find(perm, perm + n, l) > std::find(perm, perm + n, r)) continue;
		for (auto i : perm) printf("%d ", i + 1);
		puts("");
		return;
	};
	puts("-1");
}

int main() {
	int n = ri();
	int l = ri() - 1;
	int r = ri() - 1;
	int a[n];
	for (auto &i : a) i = ri() - 1;
	// solve_gu(n, l, r, a);
	if (!std::next_permutation(a, a + n)) {
		puts("-1");
		return 0;
	}
	int max[n];
	max[n - 1] = a[n - 1];
	for (int i = n; --i; ) max[i - 1] = std::max(max[i], a[i - 1]);
	int lpos = std::find(a, a + n, l) - a;
	int rpos = std::find(a, a + n, r) - a;
	if (lpos > rpos) {
		int i = rpos;
		while (i >= 0 && max[i] == a[i]) i--;
		if (i == -1) {
			puts("-1");
			return 0;
		}
		int min = 1000000000, index = -1;
		for (int j = i + 1; j < n; j++) if (a[j] > a[i] && min > a[j]) min = a[j], index = j;
		std::swap(a[i], a[index]);
		std::sort(a + i + 1, a + n);
		
		bool l_found = false;
		bool r_bury = false;
		for (auto j : a) {
			if (j == l) {
				l_found = true;
				printf("%d ", l + 1);
				if (r_bury) printf("%d ", r + 1);
			} else if (j == r && !l_found) r_bury = true;
			else printf("%d ", j + 1);
		}
		puts("");
	} else {
		for (auto i : a) printf("%d ", i + 1);
		puts("");
	}
	
	return 0;
}