#include "perm.h"
#include<bits/stdc++.h>
using namespace std;
mt19937 rng(time(NULL));
long long dp[120], a[120];
int mn;
vector<int> ans;
void go(long long k, int p[]) {
for(int i = 1; i <= 3; ++i) {
a[i] = p[i-1];
}
int n = 3;
long long cur = 1;
for(int i = 1; i <= 3; ++i) {
dp[i] = 1;
for(int j = 1; j < i; ++j) {
if(a[j]<a[i]) {
dp[i] += dp[j];
}
}
cur += dp[i];
}
while(cur<k) {
vector<pair<int, long long> > b;
for(int i = 1; i <= n; ++i) {
b.push_back({a[i], dp[i]});
}
sort(b.begin(), b.end());
long long add = 1, need = k-cur;
int nxt = 0;
for(auto [x, y] : b) {
if(add+y<=need) {
nxt = x+1;
add += y;
}
}
for(int i = 0; i <= n; ++i) {
if(a[i] >= nxt) {
a[i]++;
}
}
a[++n] = nxt;
dp[n] = add;
cur += add;
}
vector<int> res;
for(int i = 1; i <= n; ++i) {
res.push_back(a[i]);
}
if(n<mn) {
mn = n;
ans = res;
}
}
std::vector<int> construct_permutation(long long k) {
if(k <= 7) {
vector<int> ans(k-1);
for(int i = 0; i < k-1; ++i) {
ans[i]=k-i-2;
}
return ans;
}
mn = 1e9;
int p[] = {0, 1, 2};
do {
go(k, p);
} while(next_permutation(p, p+3));
return ans;
}
