#include <stdio.h>

#define LL long long
#define MAX_N 35

int n, m;
LL c[MAX_N][MAX_N][MAX_N];
LL fin[MAX_N];

void parc(int n, LL m, int afis) {
	LL cop = m;
	
	if (n == 0) return;
	
	for (int i = 0; i < n; i++)
		if (c[n][i][n - i - 1] < cop) cop -= c[n][i][n - i - 1];
		else {
			printf("%d ", afis + i);
			
			parc(i, cop / fin[n - i - 1], afis);
			if (cop != fin[n - i - 1]) parc(n - i - 1, cop % fin[n - i - 1], afis + i + 1);
			else parc(n - i - 1, cop, afis + i + 1);
			
			break;
		}
}

int main() {

	freopen("planeta.in", "r", stdin);
	freopen("planeta.out", "w", stdout);
	
	scanf("%d %d", &n, &m);
	c[1][0][0] = 1;
	fin[0] = fin[1] = 1;
	for (int i = 2; i <= n; i++)
		for (int j = 0; j < i; j++) {
			c[i][j][i - j - 1] = fin[j] * fin[i - j - 1];
			fin[i] += c[i][j][i - j - 1];
		}
	
	parc(n, m, 1);
	
	return 0;
}