#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef __int128 lll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

inline lll read() {
	lll x = 0;
	char c = getchar();
	while (c < '0' || c > '9') {
		c = getchar();
	}
	while ('0' <= c && c <= '9') {
		x = x * 10 + c - '0';
		c = getchar();
	}
	return x;
}

const int maxn = 35;

ll n, m, p[maxn];
lll K, f[maxn][maxn][maxn][maxn * maxn / 2];
bool vis[maxn];

inline lll calc(int P) {
	int s = 0;
	for (int i = 1; i <= P; ++i) {
		s += abs(p[i] - i);
	}
	if (s > m) {
		return 0;
	}
	s = m - s;
	f[0][0][0][0] = 1;
	// printf("P: %d %d\n", P, s);
	// for (int i = 1; i <= n; ++i) {
		// printf("%d%c", vis[i], " \n"[i == n]);
	// }
	for (int i = 1; i <= n; ++i) {
		// printf("  i: %d\n", i);
		for (int j = 0; j <= i; ++j) {
			for (int k = 0; k <= i; ++k) {
				for (int l = j + k; l <= s; ++l) {
					int pj = j, pk = k - (!vis[i]) + 1;
					if (i > P) {
						f[i][j][k][l] += pk * f[i - 1][pj][pk][l - j - k];
					}
					pj = j - (i > P) + 1;
					pk = k;
					if (!vis[i]) {
						f[i][j][k][l] += pj * f[i - 1][pj][pk][l - j - k];
					}
					if (i > P && !vis[i]) {
						f[i][j][k][l] += f[i - 1][j][k][l - j - k];
						f[i][j][k][l] += f[i - 1][j + 1][k + 1][l - j - k] * (j + 1) * (k + 1);
					}
					pj = j - (i > P);
					pk = k - (!vis[i]);
					if (pj >= 0 && pk >= 0) {
						f[i][j][k][l] += f[i - 1][pj][pk][l - j - k];
					}
					// if (f[i][j][k][l]) {
						// printf("%d %d %d %d %lld\n", i, j, k, l, (ll)f[i][j][k][l]);
					// }
				}
			}
		}
	}
	lll ans = f[n][0][0][s];
	for (int i = 1; i <= n; ++i) {
		for (int j = 0; j <= i; ++j) {
			for (int k = 0; k <= i; ++k) {
				for (int l = j + k; l <= s; ++l) {
					f[i][j][k][l] = 0;
				}
			}
		}
	}
	return ans;
}

void solve() {
	scanf("%lld%lld", &n, &m);
	K = read();
	for (int i = 1; i <= n; ++i) {
		for (p[i] = 1; p[i] <= n; ++p[i]) {
			if (vis[p[i]]) {
				continue;
			}
			vis[p[i]] = 1;
			lll t = calc(i);
			vis[p[i]] = 0;
			if (K > t) {
				K -= t;
			} else {
				vis[p[i]] = 1;
				break;
			}
		}
		// printf("i: %d %lld\n", i, (ll)K);
	}
	for (int i = 1; i <= n; ++i) {
		printf("%lld%c", p[i], " \n"[i == n]);
	}
}

int main() {
	int T = 1;
	// scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}