#include<bits/stdc++.h>
#include "perm.h"
using namespace std;
#define fall(i,a,b) for(int i=a;i<=b;i++)
#define rfall(i,a,b) for(int i=a;i>=b;i--)
#define sz(x) (int)x.size()
vector<int> construct_permutation(long long k){
vector<int> ans(60);
fall(i,0,59) ans[i]=i;
long long mask=(1LL<<60)-k;
rfall(i,59,0){
if(mask<(1LL<<i)) break;
mask-=(1LL<<i);
ans.pop_back();
}
fall(i,0,sz(ans)-2) if((mask & (1LL<<i))) swap(ans[i],ans[i+1]);
return ans;
}
/*
int main(){
int q; cin>>q;
while(q--){
int n; cin>>n;
vector<int> v=construct_permutation(n);
for(auto u:v) cout<<u<<" ";
cout<<"\n";
}
}*/
