#include <bits/stdc++.h>
#pragma GCC optimize(3)
using namespace std;
const int N = 35;
const int M = N * N / 2;
int n, b, mxb;
__int128 m;
bool used[N];
__int128 f[2][N * N][N][N];
int mu[N][N], ad[N][N];
int a[N], cur_cnt = 0, cur_b = 0;

void read(__int128 &x) {
	x = 0; char c = getchar();
	for(; c < '0' || c > '9'; c = getchar());
	for(; c >= '0' && c <= '9'; c = getchar())
		x = x * 10 + (c - '0');
}
void print(__int128 x) {
	if(x > 9) print(x / 10);
	putchar(x % 10 + '0');
}
__int128 calc(int x, int cnt, int bb) {
	for(int i = 0; i < 2; i++)
		for(int j = M - mxb; j <= M + mxb; j++)
			for(int k = 0; k <= n + 1; k++)
				for(int h = 0; h <= n + 1; h++)
					f[i][j][k][h] = 0;
	f[x & 1][M + bb][cnt][0] = 1;
	for(int i = x + 1; i <= n; i++) {
		int cur = i & 1;
		int pre = cur ^ 1;
		for(int j = M - mxb; j <= M + mxb; j++)
			for(int k = 0; k <= n; k++)
				for(int h = 0; h <= n; h++) {
					f[cur][j][k][h] = 0;
				}
		for(int j = M - mxb; j <= M + mxb; j++)
			for(int k = 0; k <= n; k++)
				for(int h = 0; h <= n; h++) {
					if(!f[pre][j][k][h]) continue;
					if(!used[i]) {
						f[cur][j][k][h] += ad[k][h] * f[pre][j][k][h];
						f[cur][j - 2 * i][k + 1][h + 1] += f[pre][j][k][h];
						if(k && h) f[cur][j + 2 * i][k - 1][h - 1] += mu[k][h] * f[pre][j][k][h];
					}
					else {
						f[cur][j][k][h + 1] += f[pre][j][k][h];
						if(k) f[cur][j + 2 * i][k - 1][h] += k * f[pre][j][k][h];
					}
				}
	}
	return f[n & 1][M + b][0][0];
}
int main() {
	// int cur = clock();
	cin >> n >> b; read(m);
	for(int i = 1; i <= n; i++) mxb += abs(n - i + 1 - i);
	for(int i = 0; i <= n; i++)
		for(int j = 0; j <= n; j++)
			mu[i][j] = i * j, ad[i][j] = 1 + i + j;
	// mxb = n * n;
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= n; j++) {
			if(used[j]) continue;
			used[j] = 1, a[i] = j;
			int nxt_cnt = 0;
			for(int k = 1; k <= i; k++) if(!used[k]) ++nxt_cnt;
			int nxt_b = cur_b;
			if(j > i) nxt_b += -i;
			if(j < i) nxt_b += i;
			bool flag = 0;
			for(int k = 1; k < i; k++) {
				if(a[k] == i) flag = 1;
			}
			if(flag) nxt_b += i;
			else if(a[i] != i) nxt_b -= i;
			__int128 rem = calc(i, nxt_cnt, nxt_b);
			if(rem >= m) {
				cur_cnt = nxt_cnt, cur_b = nxt_b;
				break;
			}
			else {
				used[j] = 0;
				m -= rem;
			}
		}
	}
	for(int i = 1; i <= n; i++) cout << a[i] << " ";
	cout << "\n";
	// cout << clock() - cur << "\n";
	return 0;
}