/*
* Author: Nonoze
* Created: Sunday 11/08/2024
*/
#include <bits/stdc++.h>
#include "doll.h"
using namespace std;
#ifndef _IN_LOCAL
#define dbg(...)
#endif
#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)
template<typename T> void read(T& x) { cin >> x;}
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second);}
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }
#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
// #define int long long
const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=25;
int m, n;
vector<int> a;
void subtask1() {
a.insert(a.begin(), 0); a.pb(0); n+=2;
vector<int> ans(m+1);
for (int i=1; i<n; i++) ans[a[i-1]]=a[i];
answer(ans, {}, {});
}
vector<int> ans, x, y;
void build(int prec, bool left, vector<int>& nxt) {
assert(sz(nxt));
if (sz(nxt)==1) {
if (nxt[0]==inf) nxt[0]=-prec;
if (prec<=0) ans[-prec]=nxt[0];
else if (left) x[prec-1]=nxt[0];
else y[prec-1]=nxt[0];
return;
}
if (prec<=0) ans[-prec]=-sz(x)-1;
else if (left) x[prec-1]=-sz(x)-1;
else y[prec-1]=-sz(x)-1;
x.pb(inf), y.pb(inf);
vector<int> nxt1, nxt2;
int s=sz(x);
if (sz(nxt)%2) nxt.insert(nxt.begin(), -s);
for (int i=0; i<sz(nxt); i++) {
if (i%2==0) nxt1.pb(nxt[i]);
else nxt2.pb(nxt[i]);
}
build(s, 1, nxt1);
build(s, 0, nxt2);
}
void create_circuit(int MM, vector<int> AA) { m=MM, a=AA, n=sz(a); ans.resize(m+1, a[0]);
vector<vector<int>> nxt(m+1); nxt[0].pb(a[0]);
for (int i=0; i<n; i++) nxt[a[i]].pb((i<n-1?a[i+1]:0));
for (int i=0; i<=m; i++) {
if (sz(nxt[i])<2) { ans[i]=(sz(nxt[i])?nxt[i][0]:0); continue; }
build(-i, 1, nxt[i]);
}
answer(ans, x, y);
}
