#include<bits/stdc++.h>
using namespace std;
using lli = long long;
const int maxN = 55;
lli dp[maxN][maxN][2],n,k;
void input()
{
    cin >> n >> k;
}
vector<int> v;
lli calc(int n)
{
    if (n == 1) return 1;
    lli res = 0;
    for (int j = 1;j <= n;++j)
        res += dp[n][j][0] + dp[n][j][1];
    return res;
}
void solve()
{
    dp[1][1][0] = dp[1][1][1] = 1;
    for (int i = 2;i <= n;++i)
    {
        for (int j = 1;j <= i;++j)
        {
            dp[i][j][0] = 0;
            dp[i][j][1] = 0;
            for (int k = j;k < i;++k)
            {
                //cout << k << "a\n";
                dp[i][j][0] += dp[i - 1][k][1];
            }
            //cout << j << "A\n";
            for (int k = j - 1;k >= 1;--k)
            {
                //cout << k << "b\n";
                dp[i][j][1] += dp[i - 1][k][0];
            }
        }
    }
    for (int i = 1;i <= n;++i) v.push_back(i);
    if (calc(n) < k) cout << -1;
    else
    {
        for (int i = n;i >= 1;--i)
        {
            lli sum = 0;
            for (int j = 1;j <= n;++j)
            {
                sum += dp[i][j][1] + dp[i][j][0];
                if (sum >= k)
                {
                    cout << v[j - 1] << " ";
                    swap(v[j - 1],v.back());
                    v.pop_back();
                    sort(v.begin(),v.end());
                    k = k - sum;
                    break;
                }
            }
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
//    freopen("P2.inp","r",stdin);
//    freopen("P2.out","w",stdout);
    input();
    solve();
}