#include "doll.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define ff first
#define ss second

const int maxn = 1e6 + 10;

int n, s, pw, l, id, a[maxn];
vector <int> X, Y;
vector <int> c;
map <int, int> lf, rg;
vector <pair <int, int> > d;

void get(int v, int tl, int tr) {
	int tm = (tl + tr) / 2;
	if (tm <= l) {
		lf[v] = -1;
	}
	if (tm + 1 == tr) {
		rg[v] = a[tr];
		// cnt++;
	} else {
		s--;
		rg[v] = s;
		get(s, tm + 1, tr);
	}
	if (tl == tm && lf[v] == 0) {
		lf[v] = a[tl];
		// cnt++;
	} else {
		if (lf[v] == 0) {
			s--;
			lf[v] = s;
			get(s, tl, tm);
		}
	}
	// cout << v << " " << lf[v] << " " << rg[v] << '\n';
}

void create_circuit(int M, std::vector<int> A) {
	A.push_back(0);	
	// c = {A[0]};
// 	A.erase(A.begin());
	// a = A;
	n = A.size();
	pw = 2;
	while(pw < n) {
		pw *= 2;
	}
	while(l + n < pw) {
		l++;
		a[l] = -1;
	}
	for (int i = 0; i < A.size(); i++) {
		int x = 0;
		for (int j = 19; j >= 0; j--) {
			if ((((i + l) >> j) & 1) == 1) {
				x += (1 << (19 - j));
			}
		}
		d.push_back({x, A[i]});
	}
	sort(d.begin(), d.end());
	id = l + 1;
	for (int i = 0; i < d.size(); i++) {
		a[id] = d[i].ss;
		id++;
	}
	s = -1;
	get(-1, 1, pw);
	for (int i = 1; i <= M; i++) {
		c.push_back(-1);
	}
	c.push_back(-1);
	for (int i = -1; i >= s; i--) {
		X.push_back(lf[i]);
		Y.push_back(rg[i]);
		// cout << i << " " << lf[i] << " " << rg[i] << '\n';
	}
	// for (int i = 0; i < c.size(); i++) {
	// 	cout << c[i] << " ";
	// }
	// cout << '\n';
	answer(c, X, Y);
}