#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N,P,Q;
int A[202020],rev[202020];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>P>>Q;
	set<int> L,R;
	FOR(i,N) {
		cin>>A[i];
		rev[A[i]]=i;
		L.insert(i+1);
	}
	
	
	for(i=N-1;i>=0;i--) {
		L.erase(A[i]);
		R.insert(A[i]);
		auto it=R.lower_bound(A[i]+1);
		if(it==R.end()) continue;
		
		if(L.count(P)&&rev[P]<rev[Q]) {
			out:
			A[i]=*it;
			R.erase(it);
			
			for(j=i+1;j<N;j++) {
				A[j]=*R.begin();
				R.erase(R.begin());
			}
			
			
			FOR(i,N) cout<<A[i]<<" ";
			cout<<endl;
			return;
		}
		if(R.count(P)&&R.count(Q)) {
			if(*it==Q) {
				it++;
				if(it==R.end()) continue;
			}
			if(*it==P) {
				goto out;
			}
			
			A[i]=*it;
			R.erase(it);
			
			R.erase(Q);
			for(j=i+1;j<N;j++) {
				A[j]=*R.begin();
				R.erase(R.begin());
				if(A[j]==P) R.insert(Q);
			}
			FOR(i,N) cout<<A[i]<<" ";
			cout<<endl;
			return;
			
		}
		
	}
	cout<<-1<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}