#include <bits/stdc++.h>

using namespace std;

const int N = 35;

__int128 f[N << 1][N][N * N];
int val[N], vis[N], usd[N << 1];

signed main() {
    int n, m; scanf("%d%d", &n, &m); m >>= 1;
    __int128 z = 0; string S; cin >> S;
    for (auto c : S) z = z * 10 + c - '0';
    for (int i = 1; i <= n; ++i) {
        val[i] = 1;
        while (1) {
            if (vis[val[i]]) { ++val[i]; continue;}
            int T = m;
            for (int j = 1; j <= n + n; ++j) usd[j] = 0;
            for (int j = 1; j <= i; ++j) usd[(j << 1) - 1] = usd[val[j] << 1] = 1, T -= max(val[j] - j, 0);
            memset(f, 0, sizeof(f));
            f[0][0][0] = 1;
            for (int j = 1, d1 = 0, d2 = 0; j <= 2 * n; ++j) {
                for (int k = 0; k <= d1 && k <= d2; ++k) {
                    for (int l = 0; l <= T; ++l) if (f[j - 1][k][l]) {
                        if (usd[j]) f[j][k][l + ((j & 1) ? (d1 - k) : 0)] += f[j - 1][k][l];
                        else {
                            if (j & 1) {
                                f[j][k][l + (d1 - k)] += f[j - 1][k][l];
                                f[j][k + 1][l + (d1 - k)] += f[j - 1][k][l] * (d2 - k);
                            } else {
                                f[j][k][l] += f[j - 1][k][l];
                                f[j][k + 1][l] += f[j - 1][k][l] * (d1 - k);
                            }
                        }
                    }
                }
                if (!usd[j]) ++((j & 1) ? d1 : d2);
            }
            __int128 s = f[n << 1][n - i][T];
            if (s >= z) break;
            z -= s, ++val[i];
        }
        printf("%d%c", val[i], " \n"[i == n]);
        vis[val[i]] = 1;
    }
    return 0;
}