#include<bits/stdc++.h>
#include<messy.h>
#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 1e6 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18;
vector<int> restore_permutation(int n, int w, int r)
{
string s;
for(int i=1; i<=n; i++) s += '0';
for(int i=1; i<=n; i++)
{
s[i - 1] = '1';
add_element(s);
}
compile_set();
vector<int> p;
for(int i=0; i<n; i++)
{
p[i] = -1;
s[i] = '0';
}
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
{
if(p[j - 1] != -1) continue;
s[j - 1] = '1';
if(check_element(s))
{
p[j - 1] = i - 1;
break;
}
else s[j - 1] = '0';
}
return p;
}
/*void Solve()
{
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ReadInput();
Solve();
}*/
