// #pragma GCC optimize("Ofast,no-stack-protector")
#include <bits/stdc++.h>

using namespace std;

const int N = 60;
const int inf = 1 << 30;
const long long llinf = 1ll << 60;
const double PI = acos(-1);

#define lowbit(x) (x & -x)
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<db, db> pdd;
typedef pair<ll, int> pli;

int n;
ll k;
int p[N], q[N];
bool vis[N];
ll makeDP(int chosen)
{
    memset(q, 0, sizeof(q));
    for (int i = 1; i <= n; i++)
        if (p[i] != 0)
            q[p[i]] = i;
    static ll dp[N][N][2];
    // 0 = last < now
    // 1 = last > now
    memset(dp, 0, sizeof(dp));
    int rest = n - chosen;
    dp[0][0][0] = dp[0][rest + 1][1] = 1;
    for (int i = 1; i <= n; i++)
    {
        if (q[i])
        {
            if (i == 1)
                dp[i][0][1] = dp[i][0][0] = 1;
            else
            {
                if (!q[i - 1])
                    for (int j = 1; j <= rest + 1; j++)
                        dp[i][0][1] += dp[i - 1][j][0];
                else if (q[i - 1] > q[i])
                    dp[i][0][1] = dp[i - 1][0][0];
                else
                    dp[i][0][0] = dp[i - 1][0][1];
            }
        }
        else
        {
            if (i == 1)
            {
                for (int j = 1; j <= rest; j++)
                    dp[i][j][0] = dp[i][j][1] = 1;
            }
            else
            {
                for (int j = 1; j <= rest; j++)
                {
                    for (int k = 0; k <= j; k++)
                        dp[i][j][0] += dp[i - 1][k][1];
                    for (int k = j + 1; k <= rest + 1; k++)
                        dp[i][j][1] += dp[i - 1][k][0];
                }
            }
            rest--;
        }
    }
    ll ans = 0;
    for (int i = 0; i <= n - chosen; i++)
        ans += dp[n][i][0] + dp[n][i][1];
    return ans;
}
bool makePermutation()
{
    ll nowrk = 0;
    for (int num = 1; num <= n; num++)
    {
        bool flag = 0;
        for (int pos = 1; pos <= n; pos++)
        {
            if (vis[pos])
                continue;
            p[num] = pos;
            ll cnt = makeDP(num);
            if (nowrk + cnt >= k)
            {
                vis[pos] = 1;
                flag = 1;
                break;
            }
            nowrk += cnt;
        }
        if (!flag)
            return false;
    }
    return true;
}
void work()
{
    cin >> n >> k;
    if (makePermutation())
    {
        for (int i = 1; i <= n; i++)
            cout << p[i] << " \n"[i == n];
    }
    else
        cout << "-1\n";
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    while (t-- > 0)
    {
        work();
    }
}