#include <bits/stdc++.h>
using namespace std;

istream& operator >> (istream &is, __int128 &n) {
	string s;
	is >> s;
	n = 0;
	for (char c : s) {
		n = n * 10 + c - '0';
	}
	return is;
}

ostream& operator << (ostream &os, __int128 n) {
	string s = "";
	if (n == 0) {
		s = "0";
	}
	while (n) {
	    s += '0' + n % 10;
	    n /= 10;
	}
	reverse(s.begin(), s.end());
	os << s;
	return os;
}

const int N = 35;
const int L = 1870;

int n, m, b, id[N * 2], sum[N * 2][2], ans[N];
bool visa[N], visb[N], tp[N * 2];
__int128 k, dp[N * 2][N][L];

void getdp() {
	m = 0;
	for (int i = 1; i <= n; i++) {
		if (!visa[i]) {
			id[++m] = i;
			tp[m] = 0;
		}
		if (!visb[i]) {
			id[++m] = i;
			tp[m] = 1;
		}
	}
	for (int i = 1; i <= m; i++) {
		sum[i][0] = sum[i - 1][0] + (tp[i] == 0);
		sum[i][1] = sum[i - 1][1] + (tp[i] == 1);
	}
	memset(dp, 0, sizeof(dp));
	dp[0][0][930] = 1;
	for (int i = 1; i <= m; i++) {
		for (int j = 0; j <= min(sum[i][0], sum[i][1]); j++) {
			for (int l = -930; l <= 930; l++) {
				if (j >= 1 && l - id[i] >= -930) {
					dp[i][j][l + 930] += dp[i - 1][j - 1][l - id[i] + 930] * (sum[i - 1][tp[i] ^ 1] - j + 1);
				}
				if (l + id[i] <= 930) {
					dp[i][j][l + 930] += dp[i - 1][j][l + id[i] + 930];
				}
			}
		}
	}
}



int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> b >> k;
	for (int i = 1; i <= n; i++) {
		int c = 2 * n - 2 * i;
		int d = n - i;
		visa[i] = 1;
		for (int j = 1; j <= n; j++) {
			if (!visb[j]) {
				visb[j] = 1;
				getdp();
				if (dp[c][d][b - abs(j - i) + 930] < k) {
					k -= dp[c][d][b - abs(j - i) + 930];
					visb[j] = 0;
				} else {
					b -= abs(j - i);
					ans[i] = j;
					break;
				}
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		cout << ans[i] << ' ';
	}
	cout << '\n';

	return 0;
}