#include "doll.h"
#include "bits/stdc++.h"
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }
using ll=long long;
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>;
#define LLINF ((long long)1e18)
#define INF int(1e9+1e6)
#define MAXN (300006)
vector<int> X, Y;
vector<pi> order;
ll co=-1, lvl;
struct node {
int s,e,m;
ll v,state=0;
node*l=0,*r=0;
node(int S,int E){
s=S,e=E,m=(s+e)>>1;
v=co--,state=0;
X.eb(-1), Y.eb(-1);
if(e-s>1){
l=new node(s,m),r=new node(m+1,e);
X[-v-1]=l->v, Y[-v-1]=r->v;
}else l=r=0;
}
void trav() {
if(e-s<=1) {
order.eb(v, state), state^=1;
return;
}
if(state) r->trav(), state ^= 1;
else l->trav(), state ^= 1;
}
void chk() {
assert(state==0);
if(e-s<=1) return;
l->chk(), r->chk();
}
} *seg;
void create_circuit(int M, std::vector<int> jy) {
vector<int> D(M+1,-1);
DEC(i,25,0) if((1<<i)>siz(jy)) lvl=i;
assert((1<<lvl)-1 <= 2*siz(jy));
seg=new node(0, (1<<lvl)-1);
while(order.size()!=(1<<lvl))seg->trav();
seg->chk();
reverse(all(jy));
for(auto i:order) {
if(jy.empty()) break;
int x=i.f, s=i.s;
(s ? Y[-x-1] : X[-x-1]) = jy.back();
jy.pop_back();
}
Y[-order.back().f-1]=0;
answer(D,X,Y);
}
