#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define mk make_pair
#define lowbit(x) (x&(-x))
#define pb emplace_back
#define pr pair<int,int>
#define let const auto
#define all(A) A.begin(),A.end()
void chkmin(int &x,int y){x=min(x,y);}
void chkmax(int &x,int y){x=max(x,y);}
const int N=55;
int read(){
	int x=0,f=1; char c=getchar();
	while(('0'>c||c>'9')&&c!='-') c=getchar();
	if(c=='-') f=0,c=getchar();
	while('0'<=c&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return f?x:-x;
}
ll f[N][2][2],C[N][N];
int n; ll k; 
void mul(ll &t,ll p){
	t=min((__int128)k,(__int128)t*p);
}
ll calc(vector <pr> range,int i){
	auto get = [&](int l,int r){
		return f[r-l+1][l!=1][r!=n];
	};
	ll ans=1; int rn=-1;
	for(auto [l,r]:range) rn+=r-l+1;
	for(auto [l,r]:range){
		if(i>=l&&i<=r) mul(ans,get(l,i-1)),mul(ans,get(i+1,r)),mul(ans,C[rn][i-l]),mul(ans,C[rn-=i-l][r-i]),rn-=r-i;
		else mul(ans,get(l,r)),mul(ans,C[rn][r-l+1]);
	}
	return ans;
}
vector <pr> cancel(vector <pr> t,int i){
	vector <pr> s;
	for(auto [l,r]:t){
		if(i>=l&&i<=r){
			if(i>l) s.pb(l,i-1);
			if(i<r) s.pb(i+1,r);
		}
		else s.pb(l,r);
	}
	return s;
}
void print(vector <pr> range,ll res){
	vector <int> g(n+1,0);
	for(auto [l,r]:range){
		if(l==r) g[l]=1;
		for(int i=l+(l>1); i<=r-(r<n); i++) g[i]=1;
	} 
	for(int i=1; i<=n; i++) if(g[i]){
		ll val=calc(range,i);
		if(res<=val) return printf("%d ",i),print(cancel(range,i),res);
		res-=val;
	}
}
int main(){
	cin>>n>>k;
	for(int i:{0,1})
		for(int j:{0,1}) f[0][i][j]=f[1][i][j]=1;
	for(int i=0; i<=n; i++){
		C[i][0]=1;
		for(int j=1; j<=i; j++) C[i][j]=min(k,C[i-1][j-1]+C[i-1][j]);
	}
	for(int i=2; i<=n; i++){
		for(int j:{0,1})
			for(int p:{0,1}){
				for(int t=j+1; t<=i-p; t++)
					f[i][j][p]=min(k,f[i][j][p]+(ll)min((__int128)k,min((__int128)k,(__int128)f[t-1][j][1]*f[i-t][1][p])*C[i-1][t-1]));
			}
	}
	if(f[n][0][0]<k) return puts("-1"),0;
	vector <pr> s={{1,n}};
	print(s,k);
	return 0;
}