#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
const int MAX_N = 300010;
#include "Annalib.h"
// 11 means 1
// 10 means 0
void Anna( int N, long long X, int K, int P[] ){
vector<int> bad(N);
for (int i = 0;i < K;++i)
bad[ P[i] ] = true;
auto try_gen = [&](ll X, bool flip) {
vector<int> res(N);
int cnt = 0;
for (int i = 0;i < N;++i) {
if (bad[i]) continue;
if (flip ^ ((i&1) == (X&1))) {
if (++cnt > 60) break;
res[i] = true;
X>>=1;
}
}
return res;
};
auto a = try_gen(X, false);
auto b = try_gen(X, true);
vector<int> res;
DE(count(AI(a), 1), count(AI(b), 1));
if (count(AI(a), 1) >= count(AI(b), 1)) {
res = a;
}
else {
res = b;
for (int i = N-1;i >= 0;--i) if (!bad[i]) {
res[i] = true;
break;
}
}
for (int i = 0;i < N;++i)
Set(i, res[i]);
}
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
namespace {
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
}
#else
#define DE(...) 0
#define debug(...) 0
#endif
const int MAX_N = 300010;
#include "Brunolib.h"
// 11 means 1
// 10 means 0
long long Bruno( int N, int A[] ){
vector<int> bit;
for (int i = 0, j = 0;i < N;++i) {
if (A[i] == 1) {
if (i&1) bit.pb(1);
else bit.pb(0);
++j;
}
}
if (bit.size() > 60) {
bit.resize(60);
for (int &i : bit) i ^= 1;
}
reverse(AI(bit));
ll X = 0;
for (int i = 0;i < 60;++i)
X = (X<<1) + bit[i];
return X;
}
