#include <bits/stdc++.h>
#include "doll.h"
//#include "grader.cpp"
using namespace std;
const int maxn = (int)1e5 + 7;
int sz;
void solve5(int M, vector<int> A) {
int N = A.size();
vector<int> C(M + 1);
vector<int> X, Y;
C[0] = A[0];
int tmp = N - 1;
while (tmp > 0) {
sz++;
tmp >>= 1;
}
if (sz) C[1] = -1;
else C[1] = 0;
X.resize(sz);
Y.resize(sz);
tmp = N - 1;
for (int i = 1; i <= sz; i++) {
if ((tmp >> (sz - i)) & 1) {
X[i - 1] = A[0];
} else {
X[i - 1] = -1;
}
Y[i - 1] = ((i == sz) ? 0 : -(i + 1));
}
answer(C, X, Y);
}
void solve123(int M, vector<int> A) {
int N = A.size();
vector<int> C(M + 1);
vector<int> X, Y;
vector<int> vec[M + 1];
C[0] = A[0];
for (int i = 0; i < N; i++) {
vec[A[i]].push_back((i + 1 == N) ? 0 : A[i + 1]);
}
for (int i = 1; i <= M; i++) {
if (vec[i].size() == 1) {
C[i] = vec[i][0];
} else if (vec[i].size() == 2) {
C[i] = -(++sz);
X.push_back(vec[i][0]);
Y.push_back(vec[i][1]);
} else if (vec[i].size() == 3) {
C[i] = -(++sz);
X.push_back(-(++sz));
Y.push_back(-(++sz));
X.push_back(0);
X.push_back(0);
Y.push_back(0);
Y.push_back(0);
Y[sz - 1] = vec[i][2];
Y[sz - 2] = vec[i][1];
X[sz - 1] = vec[i][0];
X[sz - 2] = C[i];
} else if (vec[i].size() == 4) {
C[i] = -(++sz);
X.push_back(-(++sz));
Y.push_back(-(++sz));
X.push_back(0);
X.push_back(0);
Y.push_back(0);
Y.push_back(0);
Y[sz - 1] = vec[i][3];
Y[sz - 2] = vec[i][2];
X[sz - 1] = vec[i][1];
X[sz - 2] = vec[i][0];
}
}
answer(C, X, Y);
}
int cnt[maxn];
void add(int val, int v, int l, int r, vector<int> &X, vector <int> &Y) {
if (l == r) {
cnt[v]++;
return ;
}
int mid = (l + r) >> 1;
if (cnt[v + v] == cnt[v + v + 1]) {
if (l == mid) X[v - 1] = val;
add(val, v + v, l, mid, X, Y);
} else {
if (mid + 1 == r) Y[v - 1] = val;
add(val, v + v + 1, mid + 1, r, X, Y);
}
cnt[v]++;
}
void solve4(int M, vector <int> A) {
int N = A.size();
vector <int> C(M + 1);
vector <int> X, Y;
C[0] = A[0];
for (int i = 1; i < 16; i++) {
X.push_back(-(i + i));
Y.push_back(-(i + i + 1));
}
for (int i = 1; i <= M; i++) {
C[i] = -1;
}
for (int i = 1; i < N; i++) {
add(A[i], 1, 0, 15, X, Y);
}
add(0, 1, 0, 15, X, Y);
answer(C, X, Y);
}
void create_circuit(int M, vector<int> A) {
if (M == 1) {
solve5(M, A);
} else if (A.size() == 16) {
solve4(M, A);
} else {
solve123(M, A);
}
}
/*
2 16
1 1 1 1 2 2 2 2 1 1 1 1 2 2 2 2
*/
