#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define Mp make_pair
#define SZ(x) (int((x).size()))

typedef long long ll;
typedef double db;
typedef vector<int> vi;
typedef pair<int, int> pii;

#define lll __int128_t
const int maxn=55;
int n;
lll k;
lll f[55][55][55][2];
const lll lim=2e18;
lll add(lll a,lll b){
    return min(a+b,lim);
}
lll mul(lll a,lll b){
    return min(lim,a*b);
}
void adto(lll&a,lll b){
    a=min(lim,a+b);
}
int q[maxn];
lll calc(){
    lll ans1=1,ans2=1;
    //ji xiang xia
    
    for(int i=1;i<n;i++){
        if(q[i]&&q[i+1]){
            if((i&1)&&q[i]<q[i+1]){
                ans1=0;break;
            }
            if(!(i&1)&&q[i]>q[i+1]){
                ans1=0;break;
            }
        }
    }
    for(int i=1,j;i<=n;i=j+1){
        j=i;
        if(q[i])continue;
        while(j+1<=n&&q[j+1]==0)j++;
        if(i==1){
            if(j%2==0){
                ans1=0;break;
            }
            ans1=mul(ans1,f[j][j][0][1]);
        }
        else if(j==n){
            if(i%2==0){
                ans1=0;break;
            }
            ans1=mul(ans1,f[j-i+1][j-i+1][0][n%2==0?0:1]);
        }
        else {
            if(i%2==0||j%2==0){
                ans1=0;break;
            }
            ans1=mul(ans1,f[j-i+1][j-i+1][0][1]);
        }
    }

    for(int i=1;i<n;i++){
        if(q[i]&&q[i+1]){
            if((i&1)&&q[i]>q[i+1]){
                ans2=0;break;
            }
            if(!(i&1)&&q[i]<q[i+1]){
                ans2=0;break;
            }
        }
    }
    
    for(int i=1,j;i<=n;i=j+1){
        j=i;
        if(q[i])continue;
        while(j+1<=n&&q[j+1]==0)j++;
        if(i==1){
            if(j%2==1){
                ans2=0;break;
            }
            ans2=mul(ans2,f[j][j][0][1]);
        }
        else if(j==n){
            if(i%2==1){
                ans2=0;break;
            }
            ans2=mul(ans2,f[j-i+1][j-i+1][0][n%2==0?1:0]);
        }
        else {
            if(i%2==1||j%2==1){
                ans2=0;break;
            }
            ans2=mul(ans2,f[j-i+1][j-i+1][0][1]);
        }
    }
    lll ans=add(ans1,ans2);
    int cnt=0;
    vector<int>v;
    for(int i=1,j;i<=n;i=j+1){
        j=i;
        if(q[i])continue;
        while(j+1<=n&&q[j+1]==0)j++;
        v.pb(j-i+1);
        cnt+=v.back();
    }
    vector<lll>vv;
    for(int i=1;i<=cnt;i++)vv.pb(i);
    for(lll i:v){
        for(int j=1;j<=i;j++){
            for(lll&o:vv){
                if(o%j==0){
                    o/=j;break;
                }
            }
        }
    }
    for(lll o:vv)ans=mul(ans,o);
    return ans;
}
void solve() {
    ll kll;
    cin>>n>>kll;
    kll--;
    k=kll;
    for(int len=1;len<=n;len++){
        for(int j=0;j<len;j++){
            f[len][1][j][0]=f[len][1][j][1]=1;
        }
        for(int i=1;i<=len;i++){
            for(int j=0;j<=len;j++){
                for(int w=0;w<j;w++){
                    adto(f[len][i+1][w][0],f[len][i][j][1]);
                }
                for(int w=j;w<len-i;w++){
                    adto(f[len][i+1][w][1],f[len][i][j][0]);
                }
            }
        }
    }
    // cout<<(ll)add(f[n][n][0][0],f[n][n][0][1])<<"asdaf\n";
    if(add(f[n][n][0][0],f[n][n][0][1])<k+1){
        cout<<"-1";return;
    }
    vector<pair<int,int> >cur;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(q[j])continue;
            q[j]=i;
            lll tmp=calc();
            if(k>=tmp)k-=tmp,q[j]=0;
            else break;
        }
    }
    vector<int>p(n+1);
    for(int i=1;i<=n;i++){
        p[q[i]]=i;
    }
    if(k!=0)cout<<"-1\n";
    else
    for(int i=1;i<=n;i++){
        cout<<p[i]<<" \n"[i==n];
    }
}
signed main() {
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while(t--) solve();
    return 0;
}