#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#define ll long long
#define pb push_back
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ld long double
#define li __int128

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>; ///find_by_order(),order_of_key()
template<int D, typename T>struct vec : public vector<vec<D - 1, T>> {template<typename... Args>vec(int n = 0, Args... args) : vector<vec<D - 1, T>>(n, vec<D - 1, T>(args...)) {}};
template<typename T>struct vec<1, T> : public vector<T> {vec(int n = 0, T val = T()) : vector<T>(n, val) {}};
template<class T1,class T2> ostream& operator<<(ostream& os, const pair<T1,T2>& a) { os << '{' << a.f << ", " << a.s << '}'; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const deque<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T,greater<T> >& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T,greater<T> >& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T1,class T2> ostream& operator<<(ostream& os, const map<T1,T2>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
int ri(){int x;scanf("%i",&x);return x;}
void rd(int&x){scanf("%i",&x);}
void rd(long long&x){scanf("%lld",&x);}
void rd(double&x){scanf("%lf",&x);}
void rd(long double&x){scanf("%Lf",&x);}
void rd(string&x){cin>>x;}
void rd(char*x){scanf("%s",x);}
template<typename T1,typename T2>void rd(pair<T1,T2>&x){rd(x.first);rd(x.second);}
template<typename T>void rd(vector<T>&x){for(T&p:x)rd(p);}
template<typename C,typename...T>void rd(C&a,T&...args){rd(a);rd(args...);}
//istream& operator>>(istream& is,__int128& a){string s;is>>s;a=0;int i=0;bool neg=false;if(s[0]=='-')neg=true,i++;for(;i<s.size();i++)a=a*10+s[i]-'0';if(neg)a*=-1;return is;}
//ostream& operator<<(ostream& os,__int128 a){bool neg=false;if(a<0)neg=true,a*=-1;ll high=(a/(__int128)1e18);ll low=(a-(__int128)1e18*high);string res;if(neg)res+='-';if(high>0){res+=to_string(high);string temp=to_string(low);res+=string(18-temp.size(),'0');res+=temp;}else res+=to_string(low);os<<res;return os;}

const int N=51;
const ll mx=2e18;
ll dp[N][N][N];
ll calc(int tr,int imam,int druga){
	if(tr==0)return 1;
	if(dp[tr][imam][druga]!=-1)return dp[tr][imam][druga];
	dp[tr][imam][druga]=0;
	for(int i=0;i<imam;i++){
		dp[tr][imam][druga]+=calc(tr-1,druga+i,imam-i-1);
		if(dp[tr][imam][druga]>mx){
			dp[tr][imam][druga]=mx;
			break;
		}
	}
	return dp[tr][imam][druga];
}
ll calcmy(int tr,int slobodno,bool slob0,bool slob1){
	if(!slob0&&!slob1&&(tr%2==0))return 0;
	return calc(tr,slobodno,0);
}
int main()
{
	memset(dp,-1,sizeof dp);
	int n;
	ll k;
	rd(n,k);
	vector<int> perm;
	vector<bool> taken(n);
	for(int pos=0;pos<n;pos++){
		for(int nxt=0;nxt<n;nxt++){
			if(taken[nxt])continue;
			int cnt=0;
			if(nxt!=0&&taken[nxt-1])cnt++;
			if(nxt!=n-1&&taken[nxt+1])cnt++;
			if(cnt==1&&nxt!=0&&nxt!=(n-1))continue;
			taken[nxt]=1;
			ll options=1;
			int lst=-1;
			int notTaken=n-pos-1;
			for(int i=0;i<n;i++){
				if(taken[i]){
					if(lst!=-1){
						int a=lst,b=i-1;
						int siz=b-a+1;
						ll partOptions=calcmy(siz,notTaken,a==0,0);
						if(partOptions==0){
							options=0;
							break;
						}
						if(mx/options<=partOptions){
							options=mx;
						}
						else{
							options*=partOptions;
						}
						notTaken-=siz;
					}
					lst=-1;
				}
				else{
					if(lst==-1){
						lst=i;
					}
				}
			}
			if(lst!=-1){
				int a=lst,b=n-1;
				int siz=b-a+1;
				ll partOptions=calcmy(siz,notTaken,a==0,1);
				if(partOptions==0){
					options=0;
				}
				else {
					if(mx/options<=partOptions){
						options=mx;
					}
					else{
						options*=partOptions;
					}
				}
			}
			//cout << perm << " " << nxt << " opt: " << options << endl;
			if(options<k){
				k-=options;
				taken[nxt]=0;
			}
			else{
				perm.pb(nxt);
				break;
			}
		}
		//cout << perm << pos << endl;
		if(sz(perm)!=pos+1){
			printf("-1\n");
			return 0;
		}
	}
	for(auto p:perm){
		printf("%i ",p+1);
	}
	printf("\n");
	return 0;
}