#include <bits/stdc++.h>
//#include "grader.cpp"
#include "doll.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")
#define F first
#define S second
#define pb push_back
#define N +100500
//#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e9)
#define el '\n'
#define Max_A int(1e9)
//#define el endl
#define pii pair <int, int>
#define piii pair <int, pair <int, int> >
#define psi pair <string, int>
#define err ld(1e-9)
#define Max_S int(3e6)
#define last(x) (x).back()
#define all(x) (x).begin(), (x).end()
#define allr(x) (x).rbegin(), (x).rend()
#define arr_all(x, n) (x + 1), (x + 1 + n)
#define vi vector<int>
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;
map <int, int> mrk, state;
void create_circuit(int M, vector<int> A)
{
vi X, Y, C;
vi g[M + 1];
int i;
int n = sz(A);
C.resize(M + 1);
for (i = 0; i < sz(A) - 1; i++)
g[A[i]].pb(A[i + 1]);
i = 1;
while (i < n && A[i] == A[i - 1])
i++;
if (i == n)
{
if (sz(A) == 2)
{
C[A[0]] = -1;
X.pb(1);
Y.pb(0);
}
else if (sz(A) == 4)
{
C[A[0]] = -1;
X.pb(-2); X.pb(1); X.pb(1);
Y.pb(-3); Y.pb(1); Y.pb(0);
}
else
if (sz(A) == 1)
A[1] = C[0];
else
{
C[A[0]] = -1;
X.pb(1);
Y.pb(-2);
X.pb(-1);
Y.pb(0);
// X.pb(1);
// Y.pb(0);
}
C[0] = A[0];
answer(C, X, Y);
return;
}
A.pb(0);
g[A[n - 1]].pb(0);
for (i = 1; i <= M; i++)
{
if (!sz(g[i]))
continue;
if (sz(g[i]) == 1)
C[i] = last(g[i]);
else
{
vi now;
C[i] = -(sz(X) + 1);
int id = sz(X) + 2;
now.pb(id - 1);
int cnt = 1;
while (cnt < sz(g[i]))
{
vi nnow;
int nn = sz(X) + sz(now);
// cerr << nn << el;
X.resize(nn);
Y.resize(nn);
cnt *= 2;
for (auto x : now)
{
X[x] = -id;
Y[x] = -(id + 1);
nnow.pb(id++);
nnow.pb(id++);
}
now = nnow;
}
// for (auto x : now)
// cerr << x << el;
int nn = sz(X) + sz(now);
// cerr << nn << el;
X.resize(nn);
Y.resize(nn);
mrk.clear();
state.clear();
for (auto x : now)
mrk[x] = 1;
int j = 0, ps;
while (j < sz(g[i]))
{
ps = -C[i];
while (!mrk[ps])
{
state[ps] ^= 1;
if (state[ps])
ps = -X[ps];
else ps = -Y[ps];
}
if (!state[ps])
X[ps] = g[i][j];
else Y[ps] = g[i][j];
state[ps] ^= 1;
j++;
}
for (auto ps : now)
if (Y[ps] == 0)
{
Y[ps] = -ps;
swap(X[ps], Y[ps]);
}
}
}
C[0] = A[0];
for (auto x : C)
cout << x << " ";
cout << el;
for (auto x : X)
cout << x << " ";
cout << el;
for (auto x : Y)
cout << x << " ";
cout << el;
answer(C, X, Y);
}
//int main()
//{
// srand(time(0));
// cout.precision(3);
// cout << fixed;
// ios_base::sync_with_stdio(0);
// iostream::sync_with_stdio(0);
// ios::sync_with_stdio(0);
// cin.tie(NULL);
// cout.tie(NULL);
//
//
//// in("input.txt");
//// out("output.txt");
//
//
//}
/*
4 4
0110
0000
1101
1100
*/
