#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i = a; i < (b); ++i)
#define all(x) begin(x),end(x)
#define sz(x) (int) (x).size()
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi; 
#ifdef TOKI
#define debug(args...) LKJ("\033[1;32m["#args"]\033[0m", args)
template <class I> void LKJ(I&&x) { cerr << x << endl; }
template <class I, class...T> void LKJ(I&&x, T&&...t)
{ cerr << x << ", ", LKJ(t...); }
template <class I> void print(I a, I b)
{ while (a != b) cerr << *a++ << ' '; cerr << endl; }
#else
#define debug(...) ((void)0)
#define print(...) ((void)0)
#endif

ll INF = 2e18;

ll count_turning_permutation(int n) {
	if (n <= 1) return 1ll;
	vector<ll> dp(n), sc(n);
	rep (i, 0, n - 1) sc[i] = i + 1;
	for (int i = 3; i <= n; ++i) {
		// debug(i);
		// print(all(sc));
		fill(all(dp), 0);
		rep (j, 0, n - i + 1) {
			if (i & 1) {
				rep (k, j + 1, n - 1)
					dp[j] = min(dp[j] + sc[k], INF);
			} else {
				rep (k, 0, j + 1)
					dp[j] = min(dp[j] + sc[k], INF);
			}
		}
		swap(dp, sc);
	}
	// print(all(sc));
	return sc[0];
}

ll mul(ll a, ll b) { return (ll) min<__int128_t>((__int128_t) a * b, INF); }

int main() {
	cin.tie(0) -> sync_with_stdio(0);
	cin.exceptions(cin.failbit);

	int n;
	ll k;
	cin >> n >> k; 

	vector<ll> num(n + 1);
	rep (i, 0, n + 1) num[i] = count_turning_permutation(i);

	vector<vector<ll>> C(n + 1, vector<ll>(n + 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] = min(C[i - 1][j] + C[i - 1][j - 1], INF);
	}

	if (num[n] * 2 < k) {
		cout << -1 << '\n';
		return 0;
	}
	k -= 1;

	vi ans, left(n);
	vector<bool> used(n + 2);
	iota(all(left), 1);
	for (int i = 1; i <= n; ++i) {
		int p = 0;
		for (; p < sz(left); ++p) {
			int v = left[p];
			if (v != 1 and v != n and (used[v + 1] xor used[v - 1])) continue; 
			int prv = v, nxt = v;
			while (prv > 0 and not used[prv]) prv -= 1;
			while (nxt <= n and not used[nxt]) nxt += 1;
			if (prv != 0 and v - prv != 1 and (v - prv) % 2 != 0) continue;
			if (nxt != n + 1 and nxt - v != 1 and (nxt - v) % 2 != 0) continue; 
			used[v] = 1;
			ll cnt = 1;
			int left_num = sz(left) - 1;
			prv = 0;
			for (int i = 1; i <= n; ++i) if (used[i]) {
				cnt = mul(mul(cnt, num[i - prv - 1]), C[left_num][i - prv - 1]);
				left_num -= i - prv - 1;
				prv = i;
			}
			cnt = mul(cnt, num[n - prv]);
			// debug(i, p, left[p], k, cnt);
			used[v] = 0;
			if (k < cnt) break;
			k -= cnt;
		}
		assert(p < sz(left));
		// debug(i, left[p]);
		ans.push_back(left[p]);
		used[left[p]] = true;
		left.erase(begin(left) + p);
	}

	rep (i, 0, n) cout << ans[i] << " \n"[i == n - 1];
}