#include <iostream>
#include <cstdio>
#define int long long
using namespace std;
int n,k,C[55][55],f[55][55][2];
int book[55],ans[55];
void mul(int &x,int y){
	if (y==0)x=0;
	else if (x>(k+1)/y)x=k+1;
	else x=min(k+1,x*y);
	return;
}
int calc(){
	int ans=1;
	int cnt=0;
	for (int i=1;i<=n;i++)
		if (book[i]==0)cnt++;
	for (int i=1;i<=n;i++){
		if (book[i]==1)continue;
		int j=i;
		while(j<n&&book[j+1]==0)j++;
		mul(ans,C[cnt][j-i+1]);
		cnt-=j-i+1;
		if (i==1||j==n)mul(ans,f[0][j-i+1][1]);
		else{
			if ((j-i+1)&1)mul(ans,f[0][j-i+1][1]);
			else ans=0;
		}
		i=j;
	}
	return ans;
}
signed main(){
	cin>>n>>k;
	f[0][0][0]=f[0][0][1]=1;
	for (int t=0;t<=n;t++)
		for (int i=0;i<=t;i++){
			int j=t-i;
			if (i==0&&j==0)continue;
			for (int k=1;k<=i;k++){
				f[i][j][0]+=f[k-1][i+j-k][1];
				f[i][j][0]=min(f[i][j][0],k+1);
			}
			for (int k=1;k<=j;k++){
				f[i][j][1]+=f[i+k-1][j-k][0];
				f[i][j][1]=min(f[i][j][1],k+1);
			}
		}
	for (int i=0;i<=n;i++)C[i][0]=1;
	for (int i=1;i<=n;i++)
		for (int j=1;j<=i;j++)
			C[i][j]=min(k+1,C[i-1][j-1]+C[i-1][j]);
	for (int i=1;i<=n;i++){
		int p=-1;
		for (int j=1;j<=n;j++)
			if (book[j]==0){
				book[j]=1;
				int t=calc();
				book[j]=0;
				if (t<k)k-=t;
				else{
					p=j;
					break;
				}
			}
		if (p==-1){
			cout<<-1<<endl;
			return 0;
		}
		ans[i]=p;
		book[p]=1;
	}
	for (int i=1;i<=n;i++)cout<<ans[i]<<' ';
	cout<<endl;
	return 0;
}