#include <stdio.h>
#include <algorithm>
using namespace std;

int N, P, Q, A[200200], p, q;

int main()
{
	scanf ("%d %d %d", &N, &P, &Q);
	for (int i = 0; i < N; i++) scanf ("%d", &A[i]);

	if (!next_permutation(A, A + N)){
		puts("-1");
		return 0;
	}

	for (int i = 0; i < N; i++){
		if (A[i] == P) p = i;
		if (A[i] == Q) q = i;
	}

	if (p < q){
		for (int i = 0; i < N; i++) printf ("%d ", A[i]);
		return 0;
	}

	int u = 0;
	for (int i = q + 1; i < N; i++) u = max(u, A[i]);
	if (Q > u){
		int w = Q;
		for (q--; q >= 0; q--){
			if (w < A[q]) w = A[q];
			else if (u < A[q] && A[q] < Q) u = A[q];
			else break;
		}
	}
	sort(A + q + 1, A + N);
	reverse(A + q + 1, A + N);

	if (!next_permutation(A, A + N)){
		puts("-1");
		return 0;
	}

	for (int i = 0; i < N; i++){
		if (A[i] == P) p = i;
		if (A[i] == Q) q = i;
	}

	if (p < q){
		for (int i = 0; i < N; i++) printf ("%d ", A[i]);
		return 0;
	}

	for (int i = 0; i < q; i++) printf ("%d ", A[i]);
	for (int i = q + 1; i < p; i++) printf ("%d ", A[i]);
	printf ("%d %d ", P, Q);
	for (int i = p + 1; i < N; i++) printf ("%d ", A[i]);
	return 0;
}