#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#undef KEV
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
const int MAX_N = 300010, inf = 1e9;
#include "doll.h"
void create_circuit(int M, std::vector<int> A) {
int n = A.size(), m = M;
// C is the place where the ith trigger connect to
vector<int> C(M + 1), X, Y;
auto new_s = [&]() {
int ret = X.size();
X.pb(0), Y.pb(0);
return ret;
};
auto sid = [&](int id) { return - (id+1); };
DE(n, M);
int P = inf;
function<vector<int>(vector<int>)> solve = [&](vector<int> target) {
int osz = 2, sz = target.size();
while (osz < sz) osz <<= 1;
int more = osz - sz;
vector<int> allid(osz); iota(AI(allid), 0);
vector<int> val(osz);
vector<int> ban(osz);
function<void(int,vector<int>)> gen = [&](int more, vector<int> allid) {
if (more == 0) return ;
DE(more, allid.size());
if (more == allid.size()) {
for (int u : allid) ban[u] = true, val[u] = P;
return;
}
vector<int> L, R;
for (int i = 0;i < allid.size();++i) {
(i&1?R:L).pb(allid[i]);
}
int sz = L.size(), lm = min(more, sz), rm = more - lm;
assert(L.size() == R.size());
if (count(AI(L), osz-1)) swap(lm, rm);
DE(lm, rm);
gen(lm, L), gen(rm, R);
};
gen(more, allid);
for (int i = 0, j = 0;i < sz;++i) {
while (ban[j]) ++j;
val[j++] = target[i];
if (i == sz-1) assert(j == osz);
}
return val;
};
function<int(vector<int>)> create = [&](vector<int> target) {
if (target.size() == 1) {
return target[0];
}
assert(target.size() % 2 == 0);
int cur = new_s();
if (count(AI(target), target[0]) == target.size()) {
X[cur] = Y[cur] = target[0];
return sid(cur);
}
vector<int> L, R;
for (int i = 0;i < target.size();++i) {
(i&1?R:L).pb(target[i]);
}
assert(L.size() == R.size());
int a = create(L), b = create(R);
X[cur] = a, Y[cur] = b;
return sid(cur);
};
auto spgen = [&](vector<int> target) {
if (target.size() == 1) return target[0];
int old = X.size();
target = solve(target);
int g = create(target);
for (int i = old;i < X.size();++i) {
if (X[i] == P) X[i] = g;
if (Y[i] == P) Y[i] = g;
}
return g;
};
C[0] = A[0];
A.pb(0);
vector<vector<int>> pos(m + 1);
for (int i = 0;i < n;++i)
pos[ A[i] ].pb(i);
if (n == 16) {
C[ A[0] ] = spgen(vector<int>(begin(A)+1, end(A)));
}
else for (int i = 1;i <= m;++i) if (pos[i].size()) {
vector<int> tar;
for (int u : pos[i])
tar.pb(A[u+1]);
C[i] = spgen(tar);
}
answer(C, X, Y);
}
