#include <bits/stdc++.h>
#include "Annalib.h"
using namespace std;
void Anna(int N, long long X, int K, int P[]) {
int A[50], s[150], i, j, k;
bool f[N];
queue<int> q;
memset(A, -1, sizeof(A));
for (i = 0; i < N; ++i) f[i] = 1;
for (i = 0; i < K; ++i) f[P[i]] = 0;
for (i = 0; i < 150; ++i) s[i] = X % 2, X /= 2, q.push(i);
j = q.front();
q.pop();
k = q.front();
q.pop();
for (i = 0; i < N; i += 3) {
if (j > k) swap(j, k);
if (!s[j] && !s[k] && f[i] && f[i + 1]) {A[i / 3] = 110; j = q.front(); q.pop(); k = q.front(); q.pop(); continue;}
if (!s[j] && s[k] && f[i]) {A[i / 3] = 100; j = q.front(); q.pop(); k = q.front(); q.pop(); continue;}
if (s[j] && s[k] && f[i] && f[i + 2]) {A[i / 3] = 101; j = q.front(); q.pop(); k = q.front(); q.pop(); continue;}
if (s[j] && !s[k] && f[i] && f[i + 1] && f[i + 2]) {A[i / 3] = 111; j = q.front(); q.pop(); k = q.front(); q.pop(); continue;}
if (!s[j] && f[i + 1] && f[i + 2]) {A[i / 3] = 11; j = q.front(); q.pop(); continue;}
if (s[j] && f[i + 1]) {A[i / 3] = 10; j = q.front(); q.pop(); continue;}
if (!s[k] && f[i + 2]) {A[i / 3] = 1; k = q.front(); q.pop(); continue;}
A[i / 3] = 0;
}
for (i = 0; i < N / 3; ++i) Set(i * 3, A[i] / 100), Set(i * 3 + 1, A[i] / 10 % 10), Set(i * 3 + 2, A[i] % 10);
}
#include <bits/stdc++.h>
#include "Brunolib.h"
using namespace std;
long long Bruno(int N, int A[]) {
long long r = 0, l = 1;
int s[150], i, j, k;
memset(s, 0, sizeof(s));
queue<int> q;
for (i = 0; i < 150; ++i) q.push(i);
j = q.front();
q.pop();
k = q.front();
q.pop();
for (i = 0; i < N; i += 3) {
if (j > k) swap(j, k);
if (A[i] && A[i + 1] && A[i + 2]) {s[j] = 1; s[k] = 0; j = q.front(); q.pop(); k = q.front(); q.pop(); continue;}
if (A[i] && A[i + 1]) {s[j] = 0; s[k] = 0; j = q.front(); q.pop(); k = q.front(); q.pop(); continue;}
if (A[i] && A[i + 2]) {s[j] = 1; s[k] = 1; j = q.front(); q.pop(); k = q.front(); q.pop(); continue;}
if (A[i + 1] && A[i + 2]) {s[j] = 0; j = q.front(); q.pop(); continue;}
if (A[i]) {s[j] = 0; s[k] = 1; j = q.front(); q.pop(); k = q.front(); q.pop(); continue;}
if (A[i + 1]) {s[j] = 1; j = q.front(); q.pop(); continue;}
if (A[i + 2]) {s[k] = 0; k = q.front(); q.pop(); continue;}
}
for (i = 0; i < 150 && s[i] > -1; ++i) {
r += l * s[i];
l *= 2;
}
return r;
}
