#include <bits/stdc++.h>
using namespace std;
#include "messy.h"
vector<int> ret;
int n;
void query(int s, int e){
if (s == e) return;
string Q(n,'0');
int m = (s+e)/2;
for (int i = 0; i < s; i++){
Q[i] = '1';
}
for (int i = e+1; i < n; i++){
Q[i] = '1';
}
for (int i = s; i <= m; i++){
Q[i] = '1';
add_element(Q);
Q[i] = '0';
}
query(s,m);
query(m+1,e);
}
void solve(int s, int e, vector<int> q){
if (s == e){
ret[q[0]] = s;
return;
}
string Q(n,'0');
int ct = 0;
for (int i = 0; i < n; i++){
if (q[ct] == i){
ct++;
}
else{
Q[i] = '1';
}
}
vector<int> Lq, Rq;
for (auto x : q){
Q[x] = '1';
if (check_element(Q)) Lq.emplace_back(x);
else Rq.emplace_back(x);
Q[x] = '0';
}
int m = (s+e)/2;
solve(s,m, Lq);
solve(m+1,e, Rq);
}
vector<int> restore_permutation(int N, int w, int r) {
n = N;
ret.resize(n);
query(0,n-1);
compile_set();
vector<int> qinit;
qinit.resize(n);
iota(qinit.begin(),qinit.end(),0);
solve(0,n-1,qinit);
return ret;
}
