#include "messy.h"
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#pragma GCC target("popcnt")
using namespace std;
using ll = long long;
using ull = unsigned long long;
using lld = long double;
using ii = pair<int,int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vii = vector<ii>;
using vpll = vector<pll>;
using vlld = vector<lld>;
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define gcd(a,b) __gcd(a,b)
#define sz(x) (int)x.size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fls cout.flush()
#define fore(i, l, r) for (auto i = l; i < r; i++)
#define fo(i, n) fore (i, 0, n)
#define forex(i, r, l) for (auto i = r-1; i >= l; i--)
#define ffo(i, n) forex (i, n, 0)
bool cmin(ll &a, ll b) { if (b < a) { a=b; return 1; } return 0; }
bool cmax(ll &a, ll b) { if (b > a) { a=b; return 1; } return 0; }
const ll INF = 1e18;
const int mod = 1e9 + 7, LOG = 20;
/*
add_element("0");
compile_set();
check_element("0");
*/
vector<int> restore_permutation(int n, int w, int r) {
vector<int> p(n);
string s = "";
fo (i, n) s += "0";
fo (i, n) {
s[n-i-1] = '1';
add_element(s);
// cout << s << '\n';
}
compile_set();
string t = "";
fo (i, n) t += '?';
fo (i, n) {
fo (j, n) {
if (t[j] != '?') continue;
string nt = t;
fo (x, n) nt[x] = (t[x] == '?' ? '0' : t[x]);
nt[j] = '1';
if (check_element(nt)) {
t[j] = '1';
p[j] = n - i - 1;
break;
}
}
}
return p;
}
