#include <bits/stdc++.h>

using namespace std;

const int N = 32;
int n, b, c[N];
__int128 k;
__int128 dp[N][N][N * N];

template <class T>
void RI(T &t) {
    char c = getchar();
    for (t = 0; !isdigit(c); c = getchar());
    for ( ; isdigit(c); c = getchar()) t = t * 10 + (c ^ 48);
}

vector<int>ans;
int vis[N];

void output(__int128 x) {
    static int sta[40];
    int tp = 0;
    do sta[tp ++] = x % 10; while (x /= 10);
    while (tp --) putchar(sta[tp] ^ 48);
}

__int128 DP(int _n, int b){
    c[n + 1] = 0;
    for (int i = n; i > 0; i --) {
        c[i] = c[i + 1] + (!vis[i]);
    }
    memset(dp, 0, sizeof(dp));
    dp[n + 1][0][0] = 1;
    for (int i = n; i > 0; -- i){
        if(vis[i] == 0) {
            for (int j = 0; j + 1 <= n; ++ j)
                for (int k = 0; k + i <= (n + 1) * n / 2; ++ k)
                    dp[i][j + 1][k + i] += dp[i + 1][j][k];
            for (int j = 0; j <= n; ++ j)
                for (int k = 0; k <= (n + 1) * n / 2; k ++) {
                    dp[i][j][k] += dp[i + 1][j][k] * (n - max(i, _n) - (c[i + 1] - j));
                }
        }else {
            for (int j = 0; j <= n; ++ j)
                for (int k = 0; k <= (n + 1) * n / 2; ++ k)
                    dp[i][j][k] = dp[i + 1][j][k];
        }
        if (i > _n) {
            for (int j = 1; j <= n; ++ j)
                for (int k = i; k <= (n + 1) * n / 2; ++ k)
                    dp[i][j - 1][k - i] += dp[i][j][k] * j;
        }
        for (int j = 0; j <= n; j ++) {
            for (int k = i; k <= (n + 1) * n / 2; k ++) {
                if (dp[i][j][k]) {
                    // fprintf(stderr, "i = %d, j = %d, k = %d, f = ", i, j, k); output(dp[i][j][k]); fprintf(stderr, "\n");
                }
            }
        }
    }
    // fprintf(stderr, "_n = %d, b = %d, dp = ", _n, b); output(dp[1][0][b]); fprintf(stderr, "\n");
    return dp[1][0][b];
}

void dfs(int _n, int b, __int128 k){
    if(_n == 0) return;
    int tot = 0;
    for (int i = 1; i <= n; ++ i){
        if(vis[i]) continue;
        vis[i] = 1;
        // fprintf(stderr, "_n = %d, i = %d\n", _n, i);
        __int128 _dp = DP(n - _n + 1, b - max(0, i - (n - _n + 1)));
        if(_dp >= k){
            ans.push_back(i);
            dfs(_n - 1, b - max(0, i - (n - _n + 1)), k);
            break;
        }
        vis[i] = 0;
        k -= _dp;
    }
}

void solve(){
    cin >> n >> b;
    RI(k);
    dfs(n, b >> 1, k);
    cout << "\n";
    for (int i:ans) cout << i << " ";
}
int main(){
    // ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int T = 1; 
    while(T --) solve();
    // for (int i = 1; i <= 30; ++ i) cin >> vis[i];
    // int tot = 0;
    // for (int i = 1; i <= 30; ++ i) tot += max(vis[i] - i, 0);
    // for (int j = i + 1; j <= 30; ++ j) tot += vis[i] > vis[j];
    // cout << tot;
}