#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"
vi X, Y, A_vec;
int id_cnt, m, n;
const int RP = 1e9;
int rev(int x, int p) {
int r = 0;
f0r(i, p) if ((x >> i) & 1) r |= (1 << (p - 1 - i));
return r;
}
int build(int l, int r, int p) {
if (l == r - 1) {
int chrono = rev(l, p);
if (chrono < m - n) return RP;
return A_vec[chrono - (m - n)];
}
int mid = l + (r - l) / 2;
int lc = build(l, mid, p);
int rc = build(mid, r, p);
if (lc == rc) return lc;
X.pb(lc);
Y.pb(rc);
id_cnt++;
return -id_cnt;
}
void create_circuit(int M, vi A) {
A_vec = A;
A_vec.pb(0);
n = A_vec.size();
m = 1;
int P = 0;
while (m < n) m *= 2, ++P;
X.clear();
Y.clear();
id_cnt = 0;
int root = build(0, m, P);
f0r(i, X.size()) {
if (X[i] == RP) X[i] = root;
if (Y[i] == RP) Y[i] = root;
}
vi C(M + 1, root);
answer(C, X, Y);
}
