#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pi pair<int,int>
#define vi vector<int>
#define rep(i,x,n) for(int i=x; i<n; ++i)
#define For(i,n) rep(i,0,n)
#define endl "\n"
#define sp ' '
#define pb push_back
#define f first
#define s second
#define sz size()
#define all(x) (x).begin(),(x).end()
const int N = 200, OO = 1e9, mod = 1e9+7, mx = 10;
void tr(int a, int b){cout << a << sp << b << endl;}
void cmx(int &a, int b){a = max(a,b);}
void cmn(int &a, int b){a = min(a,b);}
const int dx[]{0,0,-1,1}, dy[]{1,-1,0,0};
int mp[N], ans[N];
void Anna( int n, long long X, int K, int P[] ){
memset(mp,0,sizeof(mp)); memset(ans,0,sizeof(ans));
For(i,K){
mp[P[i]] = 1;
}
vi v;
For(i,60){
if((1LL<<i) & X){
v.pb(i);
}
}
for(int i=0; i<=89; ++i){
bool ok = 1;
for(int j=i; j<=i+60; ++j){
ok &= (!mp[j]);
}
if(ok){
ans[i] = 1;
for(int x: v){
ans[i+x+1] = 1;
}
break;
}
}
For(i,n){
Set(i,ans[i]);
}
}
#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pi pair<int,int>
#define vi vector<int>
#define rep(i,x,n) for(int i=x; i<n; ++i)
#define For(i,n) rep(i,0,n)
#define endl "\n"
#define sp ' '
#define pb push_back
#define f first
#define s second
#define sz size()
#define all(x) (x).begin(),(x).end()
long long Bruno( int N, int A[] ){
int fi = 0;
For(i,N){
if(A[i]) {
fi = i;
break;
}
}
ll ans = 0;
for(int i=fi+1; i+59<N; ++i){
if(A[i]){
ans += (1LL<<(i-fi-1));
}
}
return ans;
}
