#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef __int128 LLL;
const int N=55;
const LL inf=1LL<<61;
int n,a[N];
LL k,dp[N][2],C[N][N];
inline LL ADD(LL a,LL b){return a+b>inf?inf:a+b;}
inline LL MUL(LL a,LL b){
	if(a>inf/b)return inf;
	else return a*b;
}
LL calc(){
	int cur1=0;
	for(int i=1;i<=n;++i)if(a[i]==1){
		cur1=!(i&1);
		break;
	}
	int all=0;
	LL c=1;
	for(int i=1;i<=n;++i)all+=!a[i];
	int len=0;
	for(int i=1;i<=n;++i)if(!a[i])++len;
	else c=MUL(c,C[all][len]),all-=len,len=0;
	for(int i=1,cur=cur1;i<n;++i,cur^=1)
		if(a[i]&&a[i+1]&&((a[i]<a[i+1])==cur))return 0;
		else if(a[i]&&!(a[i+1])&&cur)return 0;
		else if(a[i+1]&&!a[i]&&!cur)return 0;
	len=0;
	bool fst=1;
	for(int i=1;i<=n;++i)if(!a[i])++len;
		else{
			if(!fst&&len%2==0&&len)return 0;
			c=MUL(c,dp[len][fst?cur1:1]);
			len=0;
			fst=0;
		}
	c=MUL(c,dp[len][1]);
	return c;
}
int main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n>>k;
	dp[0][0]=dp[0][1]=1;
	dp[1][0]=dp[1][1]=1;
	C[0][0]=1;
	for(int i=1;i<=n;++i){
		C[i][0]=1;
		for(int j=1;j<=i;++j)
			C[i][j]=ADD(C[i-1][j],C[i-1][j-1]);
	}
	for(int i=1;i<=n;++i){
		for(int p=1;p<=i;++p){
			int cur=!(p&1);
			dp[i][cur]=ADD(dp[i][cur],MUL(C[i-1][p-1],MUL(dp[p-1][cur],dp[i-p][1])));
		}
	}
	if(ADD(dp[n][0],dp[n][1])<k)return cout<<"-1\n",0;
	for(int i=1;i<=n;++i){
		for(int j=1;j<=n;++j){
			if(a[j]==0){
				a[j]=i;
				LL way=calc();
//				cerr<<"DEBUG"<<i<<' '<<j<<' '<<way<<endl;
				if(k>way){k-=way;a[j]=0;}
				else{
					cout<<j<<" \n"[i==n];
					break;
				}
			}
		}
	}
	return 0;
}