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

using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;

#define all(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)


ll gcd(ll(a), ll(b)) {
    if (a == 0)return b;
    if (b == 0)return a;
    ll c = a;
    while (a % b != 0) {
        c = a % b;
        a = b;
        b = c;
    }
    return b;
}


vll F = { 1,1,2,4,10,32,122,544,2770,15872,101042,707584,
 5405530,44736512,398721962,3807514624,38783024290,
 419730685952,4809759350882,58177770225664,
 740742376475050,9902996106248192,
 138697748786275802,2030847773013704704 };

vector<bool> US;

ll multinom(vll& A) {
    ll N = A.size();
    ll S = 0;
    rep(i, N)S += A[i];
    ll res = 1;
    rep(i, N) {
        rep(j, A[i]) {
            ll g = gcd(S, j + 1);
            ll b = S / g;
            ll u = (j + 1) / g;
            res /= u;
            if (res > (1e18 + b - 1) / b + 10)return 1e18;
            res *= b;
            if (res > 1e18)return 1e18 + 1;
            S--;
        }
    }
    return res;
}

ll cnt() {
    vll A;
    ll k = 0;
    ll res = 1;
    ll N = US.size();
    rep(i, N) {
        if (!US[i])k++;
        else if (k != 0) {
            A.push_back(k);
            ll f = (F[k] + 1) / 2;
            if (res > (1e18 + f - 1) / f + 10)return 1e18 + 1;
            res *= f;
            k = 0;
        }
    }
    if (k != 0) {
        A.push_back(k);
        ll f = (F[k] + 1) / 2;
        if (res > (1e18 + f - 1) / f + 10)return 1e18 + 1;
        res *= f;
        k = 0;
    }
    ll pl = multinom(A);
    if (pl > 1e18)return 1e18 + 1;
    if (res > (1e18 + pl - 1) / pl + 10)return 1e18 + 1;
    res *= pl;
    return res;
}


void solve(ll N, ll K) {
    US.assign(N, false);
    vll AN;
    rep(i, N) {
        ll res = 0;
        vector<bool> nextOK(N, 1);
        ll pr = -1;
        rep(j, N) {
            if (US[j]) {
                nextOK[j] = 0;
                pr = j;
            }
            else {
                if (pr == -1)continue;
                if ((j - pr) % 2 == 0)continue;
                if ((j == 0 || US[j - 1]) && (j == N - 1 || US[j + 1]))continue;
                nextOK[j] = 0;
            }
        }
        bool E = 0;
        rep(j, N) {
            if (US[j])continue;
            if (!nextOK[j])continue;
            US[j] = 1;
            res = cnt();
            if (res >= K) {
                AN.push_back(j);
                E = 1;
                break;
            }
            else {
                K -= res;
            }
            US[j] = 0;
        }
        if (!E) {
            cout << -1 << endl;
            return;
        }
    }
    rep(i, N)cout << AN[i] + 1 << " \n"[i == N - 1];
}

int main() {

    ll N, K;
    cin >> N >> K;
    solve(N, K);
    
    //for (ll k = 1; k <= K; k++)cout << k << endl, solve(N, k);

}