#include <bits/stdc++.h>

#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
int inf=1000000007;
ll infl=1000000000000000007;
int mod=998244353;

bool is[1007];
vector<int>W[1007];

vector<int>calc(ll m)
{
    if(m<=78) return W[m];
    int mn=20000,k;
    for(int i=2;i<=78;i++)
    {
        int t=sz(W[i])+sz(W[m%i+1])+3*log2(m/i)/2;
        if(t<mn)
        {
            mn=t;
            k=i;
        }
    }
    vector<int>res,Q=calc(m/k);
    for(auto x:W[m%k+1]) res.pb(x+sz(Q)+sz(W[k]));
    for(auto x:W[k]) res.pb(x);
    for(auto x:Q) res.pb(x+sz(W[k]));
    return res;
}

vector<int>construct_permutation(ll m)
{
    for(int n=1;n<=8;n++)
    {
        vector<int>p(n);
        for(int i=0;i<n;i++) p[i]=i;
        while(true)
        {
            vector<int>DP(n);
            int act=1;
            for(int i=0;i<n;i++)
            {
                DP[i]=1;
                for(int j=0; j<i; j++) if(p[j]<p[i]) DP[i]+=DP[j];
                act+=DP[i];
            }
            if(!is[act])
            {
                is[act]=1;
                W[act]=p;
            }
            if(!next_permutation(all(p))) break;
        }
    }
    return calc(m);
}

ll cnt(vector<int>p)
{
    int n=sz(p);
    vector<ll>DP(n);
    ll act=1;
    for(int i=0;i<n;i++)
    {
        DP[i]=1;
        for(int j=0; j<i; j++) if(p[j]<p[i]) DP[i]+=DP[j];
        act+=DP[i];
    }
    return act;
}

/*
signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    vector<int>w=construct_permutation(123456789101111);
    cout<<sz(w)<<endl;

    return 0;
}*/