#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;

typedef long long ll;

const int N = 31;

int n, b;
__int128 k;
__int128 dp[N << 1][N][(N * N) << 2];
int vis[N], ans[N];
int pre[N << 1][2];

__int128 read() {
    __int128 num = 0;
    char c = getchar();
    while (c < '0' || c > '9')
        c = getchar();
    while ('0' <= c && c <= '9') {
        num = num * 10 + c - '0';
        c = getchar();
    }
    return num;
}
void print(__int128 n) {
    if (!n)
        return;
    print(n / 10);
    putchar(n % 10 + '0');
}

#define PI pair<int, int>
vector<PI> seq;

__int128 calc(int b) {
    sort(seq.begin(), seq.end());
    int n = (seq.size() - 1) / 2, m = n * 2, val = 0;
    for (int i = 1; i <= m; i++) {
        for (int j = 0; j <= 1; j++)
            pre[i][j] = pre[i - 1][j];
        pre[i][seq[i].second]++;
        val += seq[i].first;
    }

    for (int i = 0; i <= m; i++)
        for (int j = 0; j <= n; j++)
            for (int k = 0; k <= val; k++)
                dp[i][j][k] = 0;
    dp[0][0][0] = 1;
    for (int i = 0; i <= m; i++) {
        for (int j = 0; j <= n; j++) {
            for (int k = 0; k <= val; k++) {
                if (!dp[i][j][k])
                    continue;
                auto [v, d] = seq[i + 1];
                if (pre[i][d ^ 1] > j && k + v <= val)
                    dp[i + 1][j + 1][k + v] += dp[i][j][k] * (pre[i][d ^ 1] - j);
                dp[i + 1][j][k] += dp[i][j][k];
            }
        }
    }

    return dp[m][n][(val + b) / 2];
}

void solve() {
    scanf("%d%d", &n, &b);
    k = read();

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (vis[j])
                continue;
            seq.clear();
            seq.push_back({0, 0});
            for (int k = i + 1; k <= n; k++)
                seq.push_back({k, 0});
            for (int k = 1; k <= n; k++)
                if (!vis[k] && k != j)
                    seq.push_back({k, 1});
            __int128 res = calc(b - abs(i - j));
            if (res >= k) {
                ans[i] = j, vis[j] = 1;
                b -= abs(i - j);
                break;
            } else
                k -= res;
        }
    }
    for (int i = 1; i <= n; i++)
        printf("%d ", ans[i]);
    printf("\n");
}

int main() {
    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}