//
#ifndef __SIZEOF_INT128__
#define __SIZEOF_INT128__
#endif
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace chrono;
using namespace __gnu_pbds;
template <typename T> using oset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define rep(i, p, k) for(int i(p); i < (k); ++i)
#define per(i, p, k) for(int i(p); i > (k); --i)
#define sz(x) (int)(x).size()
#define sc static_cast
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef __int128_t lll;
//#define int ll
template <typename T = int> using par = std::pair <T, T>;
#define fi first
#define se second
#define test int _number_of_tests(in()); while(_number_of_tests--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb emplace_back
struct Timer {
string name{""};
time_point<high_resolution_clock> end, start{high_resolution_clock::now()};
duration<float, std::milli> dur;
Timer() = default;
Timer(string nm): name(nm) {}
~Timer() {
end = high_resolution_clock::now(); dur= end - start;
cout << "@" << name << "> " << dur.count() << " ms" << '\n';
}
};
template <typename T = int> inline T in()
{
static T x;
std::cin >> x;
return x;
}
std::string yn(bool b)
{
if(b) return "YES\n";
else return "NO\n";
}
template <typename F, typename S> std::ostream& operator<<(std::ostream& out, const std::pair <F, S>& par);
template <typename T> std::ostream& operator<< (std::ostream& out, const std::vector <T>& wek)
{
for(const auto& i : wek)out << i << ' ';
return out;
}
template <typename F, typename S> std::ostream& operator<<(std::ostream& out, const std::pair <F, S>& par)
{
out << '{'<<par.first<<", "<<par.second<<"}";
return out;
}
#define show(x) cerr << #x << " = " << x << '\n';
#include "Annalib.h"
#include "Brunolib.h"
void Anna(int n, ll x, int k, int p[])
{
bool d[n];
rep(i, 0, k)d[p[i]] = 1;
int t(0);
auto f = [&](){
return (t <= 60 && (x&1ll<<t++));
};
for(int i(0); i < n; i+=3){
bool w(0);
if(int(d[i])+int(d[i+1])+int(d[i+2]) <= 1){
if(d[i]){
if(f())w = 2;
else w = 1;
}
else if(d[i+1]){
if(f())w = 5;
else w = 1;
}
else if(d[i+2]){
if(f())w = 2;
else{
if(f())w = 6;
else w = 4;
}
}
else{
if(f()){
if(f())w = 7;
else w = 3;
}
{
if(f())w = 6;
else w = 4;
}
}
}
Set(i, !!(w&4));
Set(i+1, !!(w&2));
Set(i+2, !!(w&1));
}
}
ll Bruno(int n, int a[])
{
ll r(0);
int t(0);
auto f = [&](bool b){
if(t <= 60 && b)r|=1ll<<t;
++t;
};
for(int i(0); i < n; i += 3){
int w(a[i]*4 + a[i+1]*2 + a[i]);
switch(w){
case 1:
f(0);
break;
case 2:
case 5:
f(1);
break;
case 3:
f(1);f(0);
break;
case 4:
f(0);f(0);
break;
case 6:
f(0);f(1);
break;
case 7:
f(1);f(1);
break;
}
}
return r;
}
//
#ifndef __SIZEOF_INT128__
#define __SIZEOF_INT128__
#endif
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace chrono;
using namespace __gnu_pbds;
template <typename T> using oset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define rep(i, p, k) for(int i(p); i < (k); ++i)
#define per(i, p, k) for(int i(p); i > (k); --i)
#define sz(x) (int)(x).size()
#define sc static_cast
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef __int128_t lll;
//#define int ll
template <typename T = int> using par = std::pair <T, T>;
#define fi first
#define se second
#define test int _number_of_tests(in()); while(_number_of_tests--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb emplace_back
struct Timer {
string name{""};
time_point<high_resolution_clock> end, start{high_resolution_clock::now()};
duration<float, std::milli> dur;
Timer() = default;
Timer(string nm): name(nm) {}
~Timer() {
end = high_resolution_clock::now(); dur= end - start;
cout << "@" << name << "> " << dur.count() << " ms" << '\n';
}
};
template <typename T = int> inline T in()
{
static T x;
std::cin >> x;
return x;
}
std::string yn(bool b)
{
if(b) return "YES\n";
else return "NO\n";
}
template <typename F, typename S> std::ostream& operator<<(std::ostream& out, const std::pair <F, S>& par);
template <typename T> std::ostream& operator<< (std::ostream& out, const std::vector <T>& wek)
{
for(const auto& i : wek)out << i << ' ';
return out;
}
template <typename F, typename S> std::ostream& operator<<(std::ostream& out, const std::pair <F, S>& par)
{
out << '{'<<par.first<<", "<<par.second<<"}";
return out;
}
#define show(x) cerr << #x << " = " << x << '\n';
#include "Annalib.h"
#include "Brunolib.h"
void Anna(int n, ll x, int k, int p[])
{
bool d[n];
rep(i, 0, k)d[p[i]] = 1;
int t(0);
auto f = [&](){
return (t <= 60 && (x&1ll<<t++));
};
for(int i(0); i < n; i+=3){
bool w(0);
if(int(d[i])+int(d[i+1])+int(d[i+2]) <= 1){
if(d[i]){
if(f())w = 2;
else w = 1;
}
else if(d[i+1]){
if(f())w = 5;
else w = 1;
}
else if(d[i+2]){
if(f())w = 2;
else{
if(f())w = 6;
else w = 4;
}
}
else{
if(f()){
if(f())w = 7;
else w = 3;
}
{
if(f())w = 6;
else w = 4;
}
}
}
Set(i, !!(w&4));
Set(i+1, !!(w&2));
Set(i+2, !!(w&1));
}
}
ll Bruno(int n, int a[])
{
ll r(0);
int t(0);
auto f = [&](bool b){
if(t <= 60 && b)r|=1ll<<t;
++t;
};
for(int i(0); i < n; i += 3){
int w(a[i]*4 + a[i+1]*2 + a[i]);
switch(w){
case 1:
f(0);
break;
case 2:
case 5:
f(1);
break;
case 3:
f(1);f(0);
break;
case 4:
f(0);f(0);
break;
case 6:
f(0);f(1);
break;
case 7:
f(1);f(1);
break;
}
}
return r;
}
