//
#ifndef __SIZEOF_INT128__
#define __SIZEOF_INT128__
#endif
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace chrono;
using namespace __gnu_pbds;
template <typename T> using oset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define rep(i, p, k) for(int i(p); i < (k); ++i)
#define per(i, p, k) for(int i(p); i > (k); --i)
#define sz(x) (int)(x).size()
#define sc static_cast
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef __int128_t lll;
//#define int ll
template <typename T = int> using par = std::pair <T, T>;
#define fi first
#define se second
#define test int _number_of_tests(in()); while(_number_of_tests--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb emplace_back
struct Timer {
string name{""};
time_point<high_resolution_clock> end, start{high_resolution_clock::now()};
duration<float, std::milli> dur;
Timer() = default;
Timer(string nm): name(nm) {}
~Timer() {
end = high_resolution_clock::now(); dur= end - start;
cout << "@" << name << "> " << dur.count() << " ms" << '\n';
}
};
template <typename T = int> inline T in()
{
static T x;
std::cin >> x;
return x;
}
std::string yn(bool b)
{
if(b) return "YES\n";
else return "NO\n";
}
template <typename F, typename S> std::ostream& operator<<(std::ostream& out, const std::pair <F, S>& par);
template <typename T> std::ostream& operator<< (std::ostream& out, const std::vector <T>& wek)
{
for(const auto& i : wek)out << i << ' ';
return out;
}
template <typename F, typename S> std::ostream& operator<<(std::ostream& out, const std::pair <F, S>& par)
{
out << '{'<<par.first<<", "<<par.second<<"}";
return out;
}
#define show(x) cerr << #x << " = " << x << '\n';
#include "doll.h"
void create_circuit(int m, vector <int> a)
{
a.pb(0);
vector <int> c(m+1, -1);
vector <int> x{0}, y{0};
int d(1), p(0);
while(d < sz(a)){
d *= 2;
++p;
}
vector <int> v(d, -1);
int ind(0);
rep(i, 0, d){
int j(0);
rep(k, 0, p)if(i&1<<k)j |= 1<<(p-1-k);
v[j] = (j < (d-sz(a)) ? -1 : a[ind++]);
}
while(d > 2){
d /= 2;
--p;
vector <int> w(d);
rep(i, 0, d){
if(v[2*i] == v[2*i+1])w[i] = v[2*i];
else{
x.pb(v[2*i]);
y.pb(v[2*i+1]);
w[i] = -sz(x);
}
}
// cerr << v << '\n';
v = w;
}
// cerr << v << '\n';
x[0] = v[0];
y[0] = v[1];
// cerr << '{' << c << "} ";
// cerr << '{' << x << "} ";
// cerr << '{' << y << "} ";
// cerr << '\n';
answer(c, x, y);
}
