#include <bits/stdc++.h>

using namespace std;

const long long mod = 1e9 + 7;
const int MaxN = 5e1 + 5;

int n;
long long k;

void Inp()
{
    cin >> n >> k;
}

bool isup[MaxN];
bool mark[MaxN];
int res[MaxN];
long long C[MaxN][MaxN];
long long F[2][MaxN];

long long Calc(int cur)
{
    long long res = 1;
    for (int x = 1; x <= n; x++)
    {
        if (mark[x])
        {
            continue;
        }
        int y = x;
        while (y <= n && !mark[y])
        {
            y++;
        }
        if (F[isup[x]][y - x] > 1e18 || C[y - x][cur] > 1e18 || 1e18 / F[isup[x]][y - x] < C[y - x][cur])
        {
            return 1e18 + 1;
        }
        if (res > 1e18 || 1e18 / res < (F[isup[x]][y - x] * C[y - x][cur]))
        {
            return 1e18 + 1;
        }
        res *= F[isup[x]][y - x] * C[y - x][cur];
        cur -= y - x;
        x = y - 1;
    }
    return res;
}

bool Check(int x)
{
    if (isup[x])
    {
        return (!mark[x] && mark[x - 1] && mark[x + 1]);
    }
    return !mark[x];
}

void Exc()
{
    C[0][0] = 1;
    for (int x = 1; x <= n; x++)
    {
        C[0][x] = C[0][x - 1];
        for (int y = 1; y <= n; y++)
        {
            C[y][x] = min(C[y - 1][x - 1] + C[y][x - 1], (long long)1e18 + 1);
            //cout << C[y][x] << " ";
        }
        //cout << "\n";
    }
    F[0][0] = 1;
    F[1][0] = 1;
    F[0][1] = 1;
    F[1][1] = 1;
    for (int x = 2; x <= n; x++)
    {
        F[0][x] = F[1][x - 1];
        for (int y = 3; y < x; y += 2)
        {
            if (F[0][x] > 1e18 || F[0][y - 1] > 1e18 || F[1][x - y] > 1e18 || 1e18 / F[0][y - 1] < F[1][x - y])
            {
                F[0][x] = 1e18 + 1;
                continue;
            }
            long long cur = F[0][y - 1] * F[1][x - y];
            if (C[y - 1][x - 1] <= 1e18 && (cur != 0 || 1e18 / cur >= C[y - 1][x - 1]))
            {
                F[0][x] += cur * C[y - 1][x - 1];
            }
            else
            {
                F[0][x] = 1e18 + 1;
            }
            //cout << cur << " ";
            if (F[0][x] > 1e18)
            {
                F[0][x] = 1e18 + 1;
            }
        }
        if (x & 1)
        {
            F[0][x] += F[0][x - 1];
        }
        F[0][x] = min(F[0][x], (long long)1e18 + 1);
        for (int y = 2; y < x; y += 2)
        {
            if (F[1][x] > 1e18 || F[1][y - 1] > 1e18 || F[1][x - y] > 1e18 || 1e18 / F[1][y - 1] < F[1][x - y])
            {
                F[1][x] = 1e18 + 1;
                continue;
            }
            long long cur = F[1][y - 1] * F[1][x - y];
            if (C[y - 1][x - 1] <= 1e18 && (cur != 0 || 1e18 / cur >= C[y - 1][x - 1]))
            {
                F[1][x] += cur * C[y - 1][x - 1];
            }
            else
            {
                F[1][x] = 1e18 + 1;
            }
            if (F[1][x] > 1e18)
            {
                F[1][x] = 1e18 + 1;
            }
        }
        if (x % 2 == 0)
        {
            F[1][x] += F[1][x - 1];
        }
        F[1][x] = min(F[1][x], (long long)1e18 + 1);
        //cout << F[0][x] << " " << F[1][x] << "\n";
    }
    if (F[0][n] + F[1][n] < k)
    {
        cout << -1;
        return;
    }
    bool flip = false;
    for (int x = 1; x <= n; x++)
    {
        long long cur1 = F[(x & 1) ^ 1][x - 1], cur2 = F[1][n - x], cur3 = C[x - 1][n - 1];
        //cout << x << " " << cur1 << " " << cur2 << " " << cur3 << "\n";
        if (cur1 > 1e18 || cur2 > 1e18 || cur3 > 1e18 || 1e18 / cur1 < cur2 || 1e18 / (cur1 * cur2) < cur3 || k <= cur1 * cur2 * cur3)
        {
            res[1] = x;
            mark[x] = true;
            flip = (x & 1) ^ 1;
            break;
        }
        k -= cur1 * cur2 * cur3;
    }
    mark[0] = mark[n + 1] = true;
    for (int x = 1; x <= n; x++)
    {
        isup[x] = (x & 1) ^ flip ^ 1;
    }
    for (int x = 2; x <= n; x++)
    {
        for (int y = 1; y <= n; y++)
        {
            if (!Check(y))
            {
                continue;
            }
            mark[y] = true;
            long long cur = Calc(n - x);
            if (cur >= k)
            {
                res[x] = y;
                break;
            }
            mark[y] = false;
            k -= cur;
        }
    }
    for (int x = 1; x <= n; x++)
    {
        cout << res[x] << " ";
    }
}

int main()
{
    //freopen("B.INP", "r", stdin);
    //freopen("B.OUT", "w", stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int test = 1;
    //cin >> test;
    for (int x = 1; x <= test; x++)
    {
        Inp();
        Exc();
    }
    return 0;
}