#include <bits/stdc++.h>

using namespace std;

typedef __int128 i128;

inline void read128(i128 &x) {
	char c;
	while ((c = getchar()) < 48);
	for (x = c - 48; (c = getchar()) >= 48; x += (x << 3) + x + c - 48);
	return;
}

const int maxn = 35;
const int base = maxn * maxn;

inline i128 &uadd(i128 &x, const i128 &y) { return (x += y); }

int n, b;
i128 m;
int used[maxn], ans[maxn];
int haveNum[maxn], haveIndex[maxn];
i128 f[maxn][maxn][maxn * maxn * 2], g[maxn][maxn][maxn * maxn * 2];

i128 calc(int L) {
	memset(haveNum, 0, sizeof(haveNum));
	memset(haveIndex, 0, sizeof(haveIndex));
	for (int i = 1; i <= n; ++i) if (!used[i]) haveNum[i] = 1;
	for (int i = n - L + 1; i <= n; ++i) haveIndex[i] = 1;
	
	memset(f, 0, sizeof(f));
	memset(g, 0, sizeof(g));
	
	// for (int i = 1; i <= n; ++i) printf("%d ", haveNum[i]); puts("");
	// for (int i = 1; i <= n; ++i) printf("%d ", haveIndex[i]); puts("");
	
	int totIndex = 0, totNum = 0;
	f[1][0][0 + base] = 1;
	for (int i = 1; i <= n; ++i) {
		// printf("totIndex = %d\n", totIndex);
		for (int j = 0; j <= totIndex; ++j) for (int k = -n * n; k <= n * n; ++k) if (f[i][j][k + base]) {
			// printf("i = %d j = %d k = %d f = %lld\n", i, j, k, (long long)f[i][j][k + base]);
			if (haveNum[i]) {
				if (j < totIndex) uadd(g[i][j + 1][k + i + base], f[i][j][k + base] * (totIndex - j));
				uadd(g[i][j][k - i + base], f[i][j][k + base]);
			}
			else g[i][j][k + base] += f[i][j][k + base];
		}
		totNum += haveNum[i];
		// printf("totNum = %d\n", totNum);
		for (int j = 0; j <= totNum; ++j) for (int k = -n * n; k <= n * n; ++k) if (g[i][j][k + base]) {
			// printf("i = %d j = %d k = %d g = %lld\n", i, j, k, (long long)g[i][j][k + base]);
			if (haveIndex[i]) {
				if (j < totNum) uadd(f[i + 1][j + 1][k + i + base], g[i][j][k + base] * (totNum - j));
				uadd(f[i + 1][j][k - i + base], g[i][j][k + base]);
			}
			else f[i + 1][j][k + base] += g[i][j][k + base];
		}
		totIndex += haveIndex[i];
	}
	// printf("res = %lld\n", (long long)f[n + 1][totNum][b + base]);
	return f[n + 1][totNum][b + base];
}

int main(){
	scanf("%d%d", &n, &b);
	read128(m);
	
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) if (!used[j]) {
			used[j] = 1;
			ans[i] = j;
			b -= abs(i - j);
			// printf("decide i = %d j = %d\n", i, j);
			i128 res = calc(n - i);
			if (m > res) {
				m -= res;
				used[j] = 0; 
				b += abs(i - j); 
			}
			else break;
		}
	}
	
	for (int i = 1; i <= n; ++i) printf("%d ", ans[i]); puts("");
	return 0;
}