#include using namespace std; typedef long long ll; constexpr int Inf = 1000000030; constexpr ll INF= 2000000000000000000; constexpr ll MOD = 1000000007; const double PI = 3.1415926535897; typedef pair P; typedef pair PP; template inline bool chmax(T &a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T &a, T b) { if (a > b) { a = b; return 1; } return 0; } ll mod(ll val, ll M) { val = val % M; if(val < 0) { val += M; } return val; } template T RS(T N, T P, T M){ if(P == 0) { return 1; } if(P < 0) { return 0; } if(P % 2 == 0){ ll t = RS(N, P/2, M); if(M == -1) return t * t; return t * t % M; } if(M == -1) { return N * RS(N,P - 1,M); } return N * RS(N, P-1, M) % M; } int main() { int N; ll X,Y; cin >> N >> X >> Y; vector> vec(N + 1,vector(62)); for(int i = 0;i < N;i++) { ll A; cin >> A; for(int j = 0;j < 62;j++) { vec.at(i + 1).at(j) = A % 2; A /= 2; } } reverse(vec.begin(),vec.end()); for(int i = 0;i < 62;i++) { vec.at(N).at(i) = X % 2; X /= 2; } vector now(62); for(int i = 0;i < 62;i++) { now.at(i) = Y % 2; Y /= 2; } bool ret = false; vector ret2(N,1); for(int i = 0;i <= N;i++) { bool cnt1 = false; bool cnt2 = false; for(int j = 0;j < 62;j++) { if(now.at(j) == 1 && vec.at(i).at(j) == 0) { cnt1 = true; } else if(now.at(j) == 0 && vec.at(i).at(j) == 1) { cnt2 = true; } } if(cnt1 && cnt2) { break; } else if(!(cnt1 || cnt2)) { ret = true; ret2.at(i) = 3; break; } else if(cnt1) { ret2.at(i) = 2; for(int j = 0;j < 62;j++) { if(now.at(j) == 1) { if(vec.at(i).at(j) == 1) now.at(j) = 2; } } } else { ret2.at(i) = 1; for(int j = 0;j < 62;j++) { if(now.at(j) == 0) { if(vec.at(i).at(j) == 0) now.at(j) = 2; } } } } if(!ret) cout << -1 << endl; else { reverse(ret2.begin(),ret2.end()); for(int i = 0;i < N;i++) { cout << ret2.at(i) << " "; } cout << endl; } }