#include using namespace std; #define F first #define S second #define R cin>> #define Z class #define ll long long #define ln cout<<'\n' #define in(a) insert(a) #define pb(a) push_back(a) #define pd(a) printf("%.10f\n",a) #define mem(a) memset(a,0,sizeof(a)) #define all(c) (c).begin(),(c).end() #define iter(c) __typeof((c).begin()) #define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--) #define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++) #define rep(i,n) REP(i,0,n) #define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++) void pr(){ln;} templatevoid pr(const A &a,const B&...b){cout<void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<=0&&x=0&&y P; void Main() { pr(-1);return; ll n,x,y; cin >> n >> x >> y; ll a[n]; rep(i,n) R a[i]; if(!next_permutation(a,a+n)) { pr(-1); return; } rep(k,4) { int xx=-1,yy=-1; rep(i,n) { if(a[i]==x) xx=i; if(a[i]==y) yy=i; } if(xx s; rrep(i,n) { s.in(a[i]); if(s.count(x)&&s.count(y)) { iter(s) it=s.upper_bound(a[i]); if(it==s.end()) continue; a[i]=*it; s.erase(it); it=s.begin(); REP(j,i+1,n) { a[j]=*it; it++; } break; } } PR(a,n); } pr(-1); } int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}