#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

void foo() {
    int p[20], q[20];
    for (int n = 3; n <= 12; n++) {
        p[1] = 1;
        p[2] = n;
        for (int i = 3; i <= n; i++) {
            p[i] = i - 1;
        }
        int cnt = 0;
        do {
            for (int i = 1; i <= n; i++) {
                q[p[i]] = i;
            }
            bool ok = true;
            for (int i = 2; i <= n - 1; i++) {
                ok &= (q[i] - q[i - 1]) * (q[i] - q[i + 1]) > 0;
            }
            cnt += ok;
        } while (next_permutation(p + 3, p + n + 1));
        cout << cnt << "\n";
    }
    exit(0);
}

const ll inf = 2e18 + 1e9;

ll add(ll a, ll b) {
    return a + b >= inf ? inf : a + b;
}

ll mult(ll a, ll b) {
    if (b == 0) return 0;
    return a > inf / b ? inf : a * b;
}

const int N = 50 + 10;
ll dp[N][N][2]; // dp[n][k][f] : 0 - came to n from left, 1 - came to n from right
ll tot[N];
vector<pair<int, int>> pf[N];
map<int, int> fact_pf[N];

int p[N];
int pos[N];

void precalc() {
    dp[1][1][0] = 1;
    dp[1][1][1] = 1;
    tot[1] = 2;
    for (int n = 2; n <= N - 1; n++) {
        for (int k = 1; k <= n; k++) {
            for (int i = 1; i <= k - 1; i++) {
                dp[n][k][0] = add(dp[n][k][0], dp[n - 1][i][1]);
            }
            for (int i = k + 1; i <= n; i++) {
                dp[n][k][1] = add(dp[n][k][1], dp[n - 1][i - 1][0]);
            }
        }
        for (int k = 1; k <= n; k++) {
            tot[n] = add(tot[n], dp[n][k][0]);
            tot[n] = add(tot[n], dp[n][k][1]);
        }
    }
//    for (int n = 1; n <= 50; n++) {
//        cout << n << " : ";
//        for (int k = 1; k <= n; k++) {
//            cout << dp[n][k][0] << " ";
//        }
//        cout << "\n";
//    }

    for (int i = 1; i <= N - 1; i++) {
        int x = i;
        for (int j = 2; j <= x; j++) {
            if (x % j == 0) {
                pf[i].emplace_back(j, 0);
                while (x % j == 0) {
                    pf[i].back().second++;
                    x /= j;
                }
            }
        }
        fact_pf[i] = fact_pf[i - 1];
        for (auto [p, t] : pf[i]) {
            fact_pf[i][p] += t;
        }
    }
//    for (int i = 1; i <= 15; i++) {
//        cout << i << " : ";
//        for (auto [p, t] : pf[i]) {
//            cout << p << "^" << t << " ";
//        }
//        cout << "\n";
//    }
//    exit(0);
}

bool solve(int n, ll k) {
    if (k <= tot[n]) {
        for (int i = 1; i <= n; i++) {
            pos[i] = 0;
        }
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                if (pos[j] == 0) {
                    if (j == 1 || j == n || ((pos[j - 1] != 0) == (pos[j + 1] != 0))) {
                        ll cur = 1;
                        vector<int> vec;
                        for (int x = 1; x <= n; x++) {
                            if (pos[x] != 0 || x == j) {
                                vec.push_back(x);
                            }
                        }
                        vector<int> lens;
                        for (int x = 0; x + 1 < vec.size(); x++) {
                            int l = vec[x], r = vec[x + 1];
                            int len = r - l - 1;
                            if (len >= 1) {
                                lens.push_back(len);
                                if (len & 1) {
                                    cur = mult(cur, tot[len] / 2);
                                } else {
                                    cur = 0;
                                }
                            }
                        }

                        if (vec.front() != 1) {
                            lens.push_back(vec.front() - 1);
                            cur = mult(cur, tot[vec.front() - 1] / 2);
                        }
                        if (vec.back() != n) {
                            lens.push_back(n - vec.back());
                            cur = mult(cur, tot[n - vec.back()] / 2);
                        }

                        if (cur == 0) {
                            continue;
                        }
                        map<int, int> cur_pf = fact_pf[n - i];
                        int kek = 0;
                        for (int len : lens) {
                            kek += len;
                        }
                        // cout << i << " " << j << " " << kek << endl;
                        assert(kek == n - i);
                        for (int len : lens) {
                            for (auto [p, t] : fact_pf[len]) {
                                cur_pf[p] -= t;
                            }
                        }
                        for (auto [p, t] : cur_pf) {
                            while (t--) {
                                cur = mult(cur, p);
                            }
                        }

                        // cout << i << " " << j << " " << cur << "\n";

                        if (k <= cur) {
                            p[i] = j;
                            pos[j] = i;
                            break;
                        } else {
                            k -= cur;
                        }
                    }
                }
            }
        }
        return true;
    } else {
        return false;
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
#endif

    // foo();

    precalc();

    int n;
    ll k;
    cin >> n >> k;
    if (solve(n, k)) {
        for (int i = 1; i <= n; i++) {
            cout << p[i] << " ";
        }
        cout << "\n";
    } else {
        cout << "-1\n";
    }

#ifdef LOCAL
    cout << "\nTime elapsed: " << double(clock()) / CLOCKS_PER_SEC << " s.\n";
#endif
}