#include<bits/stdc++.h>

using i64 = long long;
constexpr int L = 0, R = 1;
i64 k, f[55][55][2];
int n;
int ans[55], p[55], tot;
bool solved = false;

i64 dfs(int pos, int prepos, int lr) {
    if (pos > n) return 1;
    if (~f[pos][prepos][lr])return f[pos][prepos][lr];
    i64 res = 0;
    if (p[pos]) {
        int tmp = 0;
        for (int i = 1; i <= p[pos]; i++)if (ans[i] <= pos)tmp++;
        res += dfs(pos + 1, tmp, lr);
        if (res > k)res = k + 1;
    } else {
        if ((lr ^ (pos % 2)) == L) {
            for (int i = tot + 1; i <= prepos; i++) {
                res += dfs(pos + 1, i, lr);
                if (res > k)res = k + 1;
            }
        } else {
            for (int i = prepos + 1; i <= pos; i++) {
                res += dfs(pos + 1, i, lr);
                if (res > k)res = k + 1;
            }
        }
    }
    f[pos][prepos][lr] = res;
    return res;
}

void GetAns(int pos) {
    tot++;
    if (pos > n) {
        solved = true;
        for (int i = 1; i <= n; i++)std::cout << ans[i] << " ";
        return;
    }
    for (int i = 1; i <= n; i++) {
        if (p[i])continue;
        p[i] = tot;
        int tmp = tot == 1 ? i : ans[1];
        i64 res;
        memset(f, -1, sizeof(f));
        res = dfs(2, 1, tmp % 2);
        if (res >= k) {
            ans[pos] = i;
            GetAns(pos + 1);
            return;
        }
        k -= res;
        p[i] = 0;
    }
}

void solve() {
    memset(f, -1, sizeof(f));
    std::cin >> n >> k;
    GetAns(1);
    if (!solved)std::cout << "-1\n";
}

int main() {
    std::ios::sync_with_stdio(false), std::cin.tie(nullptr);
    int CZY = 1;
    while (CZY--)solve();
}