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

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

int main() {
	int n = ri();
	int l = ri() - 1;
	int r = ri() - 1;
	int a[n];
	for (auto &i : a) i = ri() - 1;
	auto ng = [&] () {
		puts("-1");
		exit(0);
	};
	if (!std::next_permutation(a, a + n)) ng();
	int lpos = std::find(a, a + n, l) - a;
	int rpos = std::find(a, a + n, r) - a;
	if (lpos > rpos) {
		int max = -1;
		for (int i = n - 1; i > rpos; i--) max = std::max(max, a[i]);
		int i = rpos;
		while (i >= 0 && max <= a[i]) {
			if (i != rpos) max = std::max(max, a[i]);
			i--;
		}
		if (i == -1) ng();
		int min = 1000000000, index = -1;
		for (int j = i + 1; j < n; j++) if (a[j] > a[i] && j != rpos && 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;
		int head = 0;
		for (auto j : a) {
			if (j == l) {
				l_found = true;
				a[head++] = l;
				if (r_bury) a[head++] = r;
			} else if (j == r && !l_found) r_bury = true;
			else a[head++] = j;
		}
	}
	for (auto i : a) printf("%d ", i + 1);
	puts("");
	return 0;
}