#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define f0r(i, n) for (auto i = 0; i < (n); ++i)
#define fnr(i, n, k) for (auto i = (n); i < (k); ++i)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define F first
#define S second
#define ctn(x) cout << x << '\n'
#define forl(a, l) for (auto a : l)
#define ctl(l) for (auto &a : (l)) cout << a << ' '; cout << endl;
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define ub(v, x) (upper_bound(all(v), x) - begin(v))
#define pq priority_queue
template <class T>
using V = vector<T>;
using ll = long long;
using vi = V<int>;
using vl = V<ll>;
using pi = pair<int, int>;
using ti = tuple<int, int, int>;
using Adj = V<vi>;
using vvi = V<vi>;
#include "doll.h"
void create_circuit(int M, vi A) {
vi C(M + 1);
A.pb(0);
vi X, Y;
int s = 0;
map<int, vi> mp;
int p = 0;
forl(x, A) {
mp[p].pb(x);
p = x;
}
auto F = [&](int a, int b) {
X.pb(a);
Y.pb(b);
return -X.size();
};
for (auto &[x, v]: mp) {
if (v.size() == 1) C[x] = v[0];
else if (v.size() == 2) {
C[x] = F(v[0], v[1]);
}
else {
int n = v.size(), m = 1, P = -1;
while (m < n) m *= 2, ++P;
s = X.size()-1;
X.resize(X.size()+m-1);
Y.resize(Y.size()+m-1);
fnr(i, 1, m/2) {
X[s+i] = -(s+(2*i) + 1);
Y[s+i] = -(s+(2*i+1) + 1);
}
f0r(i, m/2) {
int k = m/2;
f0r(j, P) if ((i >> j) & 1) {
k |= (1 << (P-1-j));
}
// Track chronological visits for X and Y exits
int visit_X = i;
int visit_Y = i + m/2;
// The first (m - n) visits loop back to root -(s+2)
// The remaining n visits map to the real targets
if (visit_X < m - n) X[s+k] = -(s+2);
else X[s+k] = v[visit_X - (m - n)];
if (visit_Y < m - n) Y[s+k] = -(s+2);
else Y[s+k] = v[visit_Y - (m - n)];
}
C[x] = -(s + 1 + 1);
}
}
answer(C, X, Y);
return;
}
