#include <cstdio>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <set>
#include <string>
#include <queue>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <deque>
#include <map>
#include <chrono>
#include <random>
#include <bitset>
#include <tuple>
#include "perm.h"
#define SZ(x) int(x.size())
#define FR(i,a,b) for(int i=(a);i<(b);++i)
#define FOR(i,n) FR(i,0,n)
#define FAST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define A first
#define B second
#define mp(a,b) make_pair(a,b)
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef unsigned __int128 U128;
typedef __int128 I128;
typedef std::pair<int,int> PII;
typedef std::pair<LL,LL> PLL;
using namespace std;
std::vector<int> construct_permutation(long long k){
vector<vector<LL> > s;
FR(i,1,60){
if (k&(1LL<<i)){
vector<LL> tmp(i);
FOR(j,i) tmp[j]=j;
s.push_back(tmp);
}
}
LL add=__builtin_popcount(k)-1;
vector<LL> bum;
bum.push_back(0);
FOR(i,add) s.push_back(bum);
LL cur=0;
for (int i=SZ(s)-1; i>=0; i--){
LL sz=SZ(s[i]);
FOR(j,sz) s[i][j]+=cur;
cur+=sz;
}
vector<int> ans;
FOR(i,SZ(s)) FOR(j,SZ(s[i])){
ans.push_back((int)s[i][j]);
}
return ans;
}
