import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.Comparator;
import java.util.NoSuchElementException;

public class Main{
	
	public static void main(String[] args) {
		new Main().run();
	}
	
	boolean check(int[] A,int P,int Q) {
		return find(A, P) < find(A, Q);
	}
	
	void yes(int[] A) {
		for (int i=0;i<A.length;++i) {
			System.out.print(A[i]+(i==A.length-1?"\n":" "));
		}
		System.exit(0);
	}

	void no() {
		System.out.println(-1);
		System.exit(0);
	}
	
	int find(int[] A,int key) {
		for (int i=0;i<A.length;++i) if (A[i]==key) return i;
		throw new AssertionError();
	}
	
	void run() {
		FastScanner sc=new FastScanner();
		int N=sc.nextInt();
		int P=sc.nextInt();
		int Q=sc.nextInt();
		int[] A=new int[N];
		for (int i=0;i<N;++i) A[i]=sc.nextInt();
		if (!nextPermutation(A)) no();
		if (check(A, P, Q)) yes(A);
		
		while (true) {
			int iq=find(A, Q);
			Arrays.sort(A, iq+1, N);
			{
				int s=iq+1;
				int t=N-1;
				while (s<t) {
					A[s]^=A[t];A[t]^=A[s];A[s]^=A[t];
					++s;--t;
				}
			}
			if (!nextPermutation(A)) no();
			if (check(A, P, Q)) yes(A);
			if (!(iq>0&&A[iq-1]==Q)) break;
		}
		
		
		
		int ip=find(A, P);
		int iq=find(A, Q);
		for (int i=iq;i<ip;++i) {
			A[i]^=A[i+1];A[i+1]^=A[i];A[i]^=A[i+1];
		}
		//1,2,...,q,...,p
		//1,2,...,q+1,...,p,q
		if (check(A, P, Q)) yes(A);
		throw new AssertionError();
	}
	
	boolean nextPermutation(int[] a) {
		int n=a.length;
		int p=n-1;
		while (p>0 && a[p-1]>a[p]) --p;
		if (p==0) return false;
		int q=p;
		while (q+1<n && a[p-1]<a[q+1]) ++q;
		{
			a[p-1]^=a[q];a[q]^=a[p-1];a[p-1]^=a[q];
		}
		int s=p,t=n-1;
		while (s<t) {
			a[s]^=a[t];a[t]^=a[s];a[s]^=a[t];
			++s;--t;
		}
		return true;
	}
	
	void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));}
}

class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
    public boolean hasNext() { skipUnprintable(); return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
    	return (int)nextLong();
    }
}