#include <bits/stdc++.h>
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()

using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
// #define int __int128_t
using i128 = __int128;

istream& operator>> (istream& in, __int128_t& x){
    string s; in >> s;
    x = 0; for (auto c : s) x = x * 10 + c - '0';
    return in;
}

ostream& operator<< (ostream& out, __int128_t x){
    string s; while (x) s.push_back('0' + x % 10), x /= 10; if (s.empty()) s = "0";
    reverse(all(s)); return out << s;
}

template<typename T> void chadd(T& x, T y){ x += y; }

const int B = 450 + 11;
i128 dp[31][31][B * 2];
i128 dp2[31][31][B * 2];
bool ok_a[31], ok_b[31];
i128 countPerm(int n, vector<int>& p, int len, int b){
    fill(ok_a + 1, ok_a + 31, true); fill(ok_b, ok_b + 31, true);
    fill(ok_a + 1, ok_a + 1 + len, false); for (int i = 0; i < len; i++) ok_b[p[i]] = false;
    // for (int i = 1; i <= n; i++) {
    //     cout << ok_a[i] << ' ';
    // }
    // cout << endl;
    // for (int i = 1; i <= n; i++) {
    //     cout << ok_b[i] << ' ';
    // }
    // cout << endl;
    
    for (int r = 0; r <= 0; r++) {
        for (int b = 0; b < B * 2; b++) {
            dp[r][0][b] = dp[0][r][b] = 0;
        }
    }
    dp[0][0][B] = 1;
    for (int i = 0; i < n; i++) {
        for (int r = 0; r <= i + 1; r++) {
            for (int b = 0; b < B * 2; b++) {
                dp[r][i + 1][b] = dp[i + 1][r][b] = 0;
            }
        }
        auto copy_and_clear = [&] () {
            for (int rem_a = 0; rem_a <= i + 1; rem_a++) {
                for (int rem_b = 0; rem_b <= i + 1; rem_b++) {
                    for (int balance = 0; balance < B * 2; balance++) {
                        dp2[rem_a][rem_b][balance] = dp[rem_a][rem_b][balance];
                        dp[rem_a][rem_b][balance] = 0;
                    }
                }
            }
        };

        auto valid_balance = [&] (int x) {
            return 0 <= x && x < B * 2;
        };

        // top row
        if (ok_a[i + 1]) {
            copy_and_clear();
            for (int rem_a = 0; rem_a <= i; rem_a++) {
                for (int rem_b = 0; rem_b <= i; rem_b++) {
                    for (int balance = 0; balance < B * 2; balance++) {
                        i128 old_val = dp2[rem_a][rem_b][balance];
                        if (!old_val) continue;
                        // match backwards
                        if (rem_b && valid_balance(balance + (i + 1))) {
                            chadd(dp[rem_a][rem_b - 1][balance + (i + 1)], old_val * rem_b);
                        }
                        // match forwards
                        if (valid_balance(balance - (i - 1))) {
                            chadd(dp[rem_a + 1][rem_b][balance - (i + 1)], old_val);
                        }
                    }
                }
            }
        }
        // printf("Half\n");
        // for (int r = 0; r <= i + 1; r++) {
        //     for (int s = 0; s <= i + 1; s++) {
        //         for (int b = 0; b < B * 2; b++) {
        //             if (dp[r][s][b]) {
        //                 printf("dp[%lld][%lld][%lld][%lld] = %lld\n", (int64_t) (i + 1), (int64_t) r, (int64_t) s, (int64_t) b, (int64_t) dp[r][s][b]);
        //             }
        //         }
        //     }
        // }
        // bottom row
        if (ok_b[i + 1]) {
            copy_and_clear();
            for (int rem_a = 0; rem_a <= i; rem_a++) {
                for (int rem_b = 0; rem_b <= i; rem_b++) {
                    for (int balance = 0; balance < B * 2; balance++) {
                        i128 old_val = dp2[rem_a][rem_b][balance];
                        if (!old_val) continue;
                        // if (old_val) cout << rem_a << ' ' << rem_b << ' ' << balance << endl;
                        // match backwards
                        if (rem_a && valid_balance(balance + (i + 1))) {
                            chadd(dp[rem_a - 1][rem_b][balance + (i + 1)], old_val * rem_a);
                        }
                        // match forwards
                        if (valid_balance(balance - (i - 1))) {
                            chadd(dp[rem_a][rem_b + 1][balance - (i + 1)], old_val);
                        }
                    }
                }
            }
        }
        // printf("End\n");
        // for (int r = 0; r <= i + 1; r++) {
        //     for (int s = 0; s <= i + 1; s++) {
        //         for (int b = 0; b < B * 2; b++) {
        //             if (dp[r][s][b]) {
        //                 printf("dp[%lld][%lld][%lld][%lld] = %lld\n", (int64_t) (i + 1), (int64_t) r, (int64_t) s, (int64_t) b, (int64_t) dp[r][s][b]);
        //             }
        //         }
        //     }
        // }
    }

    // for (int i = B - b; i <= B + b; i++) {
    //     cout << dp[n][0][0][i] << ' ';
    // }
    // cout << endl;
    // cout << "RESULT " << dp[n][0][0][B + b] << endl;
    return dp[0][0][B + b];
}

void solve() {
    int n, b;
    i128 k;
    cin >> n >> b >> k;
    vector<int> p(n);
    vector<bool> rem(n + 1, true);
    for (int i = 0; i < n; i++) {
        for (int j = 1; j <= n; j++) {
            if (!rem[j]) continue;
            // cout << "POSITION " << i << " VALUE " << j << " => K " << k << endl;
            p[i] = j;
            vector<int> x(p.begin(), p.begin() + i + 1);
            vector<int> y; 
            i128 cp = countPerm(n, p, i + 1, b - ((i + 1) - j < 0 ? j - (i + 1) : (i + 1) - j));
            if (k <= cp) {
                rem[j] = false;
                b -= ((i + 1) - j < 0 ? j - (i + 1) : (i + 1) - j);
                break;
            } else {
                k -= cp;
            }
        }
    }
    for (int i = 0; i < n; i++) {
        cout << p[i] << ' ';
    }
    cout << '\n';
}

signed main() {
#ifndef LOCAL
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
#endif
    int T = 1;
    // cin >> T;
    while (T--) solve();
    return 0;
}