#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define int ll
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using pii = pair<int, int>;
using vi = vector<int>;
#define fi first
#define se second
#define pb push_back

const int N=50,NN=23,INF=2e18;

int dp[N+1][N+1];
int cnt[N+1];
int C[N+1][N+1];
int q[N+1];
int p[N+1];

int add(int x,int y)
{
    return min(x+y,INF);
}

int mul(int x,int y)
{
    if(y<=INF/x)
        return x*y;
    else
        return INF;
}

int solve(int n,bool up)
{
    for(int i=2;i<=n;i++)
    {
        if(up?(q[i]<q[i-1]):(q[i]>q[i-1]))
            return 0;
        up=!up;
    }
    vector<int> lens;
    for(int l=1;l<=n;l++)
        if(q[l]==INF&&(l==1||q[l-1]!=INF))
        {
            int r=l;
            while(r<n&&q[r+1]==INF)
                r++;
            lens.push_back(r-l+1);
        }
    int res=1;
    int total= accumulate(lens.begin(),lens.end(),0LL);
    for(int len:lens)
    {
        res=mul(res,cnt[len]);
        res=mul(res,C[total][len]);
        total-=len;
    }
    return res;
}

int solve(int n)
{
    int tr=solve(n,true);
    int fa=solve(n,false);
    int res=add(tr,fa);
//    for(int i=1;i<=n;i++)
//        if(q[i]==INF)
//            cout<<"oo ";
//        else
//            cout<<q[i]<<" ";
//    cout<<"-> "<<tr<<" + "<<fa<<" = "<<res<<"\n";
    return res;
}

signed main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);

    dp[1][1]=1;
    for(int i=2;i<=NN;i++)
        for(int j=1;j<=i;j++)
            if(i%2==0)
                for(int t=1;t<=j-1;t++)
                    dp[i][j]+=dp[i-1][t];
            else
                for(int t=j;t<=i-1;t++)
                    dp[i][j]+=dp[i-1][t];
    for(int i=1;i<=NN;i++)
        for(int j=1;j<=i;j++)
            cnt[i]+=dp[i][j];
    for(int i=NN+1;i<=N;i++)
        cnt[i]=INF;
//    for(int i=1;i<=N;i++)
//        cout<<i<<" -> "<<cnt[i]<<"\n";

    for(int n=0;n<=N;n++)
    {
        C[n][0]=C[n][n]=1;
        for(int k=1;k<=n-1;k++)
            C[n][k]=C[n-1][k-1]+C[n-1][k];
    }

    int n,k;
    cin>>n>>k;
    for(int i=1;i<=n;i++)
        q[i]=INF;
    if(solve(n)<k)
    {
        cout<<-1;
        return 0;
    }
    for(int i=1;i<=n;i++)
    {
        for (int j = 1; j <= n; j++)
            if(q[j]==INF)
            {
                q[j] = i;
                int cur = solve(n);
                if (cur >= k)
                    break;
                k -= cur;
                q[j] = INF;
            }
    }
    for(int i=1;i<=n;i++)
        p[q[i]]=i;
    for(int i=1;i<=n;i++)
        cout<<p[i]<<" ";
}