//chcockolateman
#include<bits/stdc++.h>
using namespace std;
std::vector<int> construct_permutation(long long k)
{
k--;
int counter = -1;
vector<int> seq;
while(k)
{
int pos = 0;
while((1ll<<(pos+1)) - 1 <= k)
pos++;
seq.push_back(pos);
counter += pos;
// printf("Pos = %d\n",pos);
k -= ((1ll<<pos) - 1);
}
vector<int> ret;
for(int L = 0 ; L < seq.size() ; L++)
{
counter = counter - seq[L] + 1;
for(int i = 1 ; i <= seq[L] ; i++)
ret.push_back(counter++);
counter = counter - seq[L] - 1;
}
return ret;
}
