#include using namespace std; typedef long long ll; typedef pair p_ll; template void debug(T itr1, T itr2) { auto now = itr1; while(now=0; i--) const ll MOD = pow(10,9)+7; const ll LLINF = pow(2,61)-1; const int INF = pow(2,30)-1; vector fac; void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; } ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; } ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; } ll gcd(ll a, ll b) { if (a> N >> P >> Q; ll A[N]; rep(i,N) cin >> A[i]; ll pos[N+1] = {}; rep(i,N) pos[A[i]] = i; set used; vector result; per(i,N) { used.insert(A[i]); if ( (pos[P]=i) || (pos[P]=i&&pos[Q]pos[Q]) ) continue; else { auto it = ++used.lower_bound(A[i]); if (it==used.end()) continue; rep(j,i) result.push_back(A[j]); result.push_back(*it); ll i1 = *it; used.erase(it); if (P