#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
const int N = 55;
const int inf = 1e9;
const int mod = 1e9 + 7;

int qpow(int a, int b) {
	int ans = 1;
	while(b) {
		if(b & 1) ans = ans * a % mod;
		b >>= 1;
		a = a * a % mod;
	}
	return ans;
}
void solve() {
	int n, k;
	cin >> n >> k;
	vector<int> vis(N, 0), pos(N), a(N);
	auto cal = [&](int sum) {
		vector<vector<vector<int>>> dp(N, vector<vector<int>>(N, vector<int>(2, 0)));
		int len = 0;
		if(vis[1] && vis[2]) {
			if(pos[1] < pos[2]) dp[2][0][0] = 1;
			else dp[2][0][1] = 1;
		}
		else if(!vis[1] && vis[2]) {
			len = 1;
			dp[2][0][1] = 1;
		}
		else if(vis[1] && !vis[2]) {
			len = 1;
			dp[2][1][0] = 1;
		}
		else {
			len = 2;
			dp[2][1][1] = dp[2][2][0] = 1;
		}
		auto calc = [&](int &x) {
			return x = min(x, sum);
		};
		for(int i = 2; i < n; i++) {
			if(vis[i + 1]) {
				if(vis[i]) {
					if(pos[i] > pos[i + 1]) {
						dp[i + 1][0][1] = dp[i][0][0];
					}
					else dp[i + 1][0][0] = dp[i][0][1];
				}
				else {
					for(int j = 1; j <= len; j++){
						dp[i + 1][0][1] += dp[i][j][0];
						calc(dp[i + 1][0][1]);
					}
				}
				continue;
			}
			for(int j = 0; j <= len; j++) {
				for(int l = 0; l < 2; l++) {
					if(dp[i][j][l]) {
						if(l == 0) {
							for(int x = 1; x <= j; x++) {
								dp[i + 1][x][1] += dp[i][j][l];
								calc(dp[i + 1][x][1]);
							}
						}
						else {
							for(int x = j + 1; x <= len + 1; x++) {
								dp[i + 1][x][0] += dp[i][j][l];
								calc(dp[i + 1][x][0]);
							}
						}
					}
				}
			}
			len++;
		}
		int ans = 0;
		if(vis[n]) {
			ans = dp[n][0][0] + dp[n][0][1];
			calc(ans);
		}
		else {
			for(int i = 1; i <= len; i++) {
				ans += dp[n][i][0] + dp[n][i][1];
				calc(ans);
			}
		}
		return ans;
	};
	for(int i = 1; i <= n; i++) {
		int res = -1;
		for(int j = 1; j <= n; j++) {
			if(vis[j]) continue;
			vis[j] = 1;
			a[i] = j;
			pos[j] = i;
			for(int l = 1; l <= n; l++) {
				if(!vis[l]) {
					pos[l] = i + 1;
				}
			}
			bool flag = 1;
			for(int l = 2; l < n; l++) {
				if((pos[l] - pos[l - 1]) * (pos[l] - pos[l + 1]) < 0) {
					flag = false;
					break;
				}
			}
			if(!flag) {
				vis[j] = 0;
				continue;
			}
			int t = cal(k);
			if(t >= k) {
				res = j;
				break;
			}
			else {
				k -= t;
				vis[j] = 0;
			}
		}
		if(res == -1) {
			cout << res << endl;
			return;
		}
		a[i] = res;
	}
	for(int i = 1; i <= n; i++) {
		cout << a[i] << " ";
	}
}
#undef int
int main() {
	ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
	int t = 1;
	// cin >> t;
	while(t--) {
		solve();
	}
}