#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef __int128_t i128;

template<typename T> void read(T &x) {
	x = 0; char ch = getchar();
	while (ch < '0' || ch > '9') ch = getchar();
	while (ch >= '0' && ch <= '9') x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
}

int n, b, p[35], vis[35];
i128 rk;

i128 calc(int x) {
	static i128 dp[35][35][455];
	for (int i = 1; i <= n; i++) for (int j = 0; j <= n; j++) {
		for (int k = 0; k <= n * n / 2; k++) dp[i][j][k] = 0;
	}
	int sm = 0, del = 0;
	for (int i = 1; i < x; i++) {
		if (p[i] >= x) del++;
		sm += max(0, min(p[i], x) - i);
	}
	dp[x - 1][del][sm] = 1;
	for (int i = x; i <= n; i++) {
		for (int j = 0; j < i; j++) {
			for (int k = 0; k <= b; k++) {
				i128 res = dp[i - 1][j][k];
				if (!res) continue;
				if (!vis[i]) {
					dp[i][j][j + k] += res; dp[i][j + 1][j + k + 1] += res;
					if (j) dp[i][j][j + k] += res * j; 
				}
				if (j) {
					dp[i][j][j + k] += res * (vis[i] ? 1 : j - del);
					dp[i][j - 1][j + k - 1] += res * (vis[i] ? 1 : j - del) * j;
				}
			}
		}
		del -= vis[i];
	}
	return dp[n][0][b];
}

int main() {
	read(n), read(b), read(rk); b >>= 1;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			if (vis[j]) continue;
			vis[j] = 1, p[i] = j;
			i128 cnt = calc(i + 1);
			if (cnt >= rk) break;
			rk -= cnt, vis[j] = 0, p[i] = 0;
		}
	}
	for (int i = 1; i <= n; i++) printf("%d%c", p[i], " \n"[i == n]);
	return 0;
}