// Not afraid to dark.

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

#define int long long

namespace io {
    int read_pos, read_dt; char read_char;
    inline int read (int &p = read_pos){
        p = 0, read_dt = 1; read_char = getchar ();
        while (! isdigit (read_char)){
            if (read_char == '-')
                read_dt = - 1;
            read_char = getchar ();
        }
        while (isdigit (read_char)){
            p = (p << 1) + (p << 3) + read_char - 48;
            read_char = getchar ();
        }
        return p = p * read_dt;
    }
    int write_sta[65], write_top;
    inline void write (int x){
        if (x < 0)
            putchar ('-'), x = - x;
        write_top = 0;
        do
            write_sta[write_top ++] = x % 10, x /= 10;
        while (x);
        while (write_top)
            putchar (write_sta[-- write_top] + 48);
    }
    int llen;
    inline int get_string (char c[], int &len = llen){
        len = 0;
        read_char = getchar ();
        while (read_char == ' ' || read_char == '\n' || read_char == '\r')
            read_char = getchar ();
        while (read_char != ' ' && read_char != '\n' && read_char != '\r'){
            c[++ len] = read_char;
            read_char = getchar ();
        }
        return len;
    }
}

const int N = 50, inf = 1e18 + 5;
int n, m, k;
int dp[N + 5][N + 5][N + 5];
int C[N + 5][N + 5];

inline int mul (int x, int y){
    if (! x || ! y)
        return 0;
    if (inf / y < x)
        return inf;
    return x * y;
}
inline int add (int x, int y){
    if (inf - y < x)
        return inf;
    return x + y;
}

int ans[N + 5];
bool vis[N + 5];

signed main (){
    io::read (n), io::read (m), io::read (k);
    C[0][0] = 1;
    for (int i = 1;i <= n;++ i){
        C[i][0] = 1;
        for (int j = 1;j <= i;++ j)
            C[i][j] = add (C[i - 1][j], C[i - 1][j - 1]);
    }
    dp[0][0][0] = 1;
    int jc = 1;
    for (int l = 1;l <= n;++ l){
        jc *= l;
        for (int i = 0;i <= l;++ i){
            if (l > 20 || (l == 20 && i >= 3))
                dp[l][i][0] = inf;
            else {
                dp[l][i][0] = jc;
                for (int j = 1;j <= l - i;++ j)
                    dp[l][i][0] -= C[l - i][j] * dp[l - j][i][0];
            }
            for (int j = 1;j <= l;++ j)
                if (j > l - i)
                    dp[l][i][j] = 0;
                else
                    dp[l][i][j] = mul (C[l - i][j], dp[l - j][i][0]);
        }
    }
    for (int p = 1, res;p <= n;++ p){
        res = 0;
        int i;
        for (i = 1;i <= n;++ i){
            if (m == 0 && i == p)
                continue;
            if (vis[i])
                continue;
            int cnt = 0, rlt;
            for (int j = p + 1;j <= n;++ j)
                if (vis[j] || i == j)
                    ++ cnt;
            rlt = res + dp[n - p][cnt][m - (i == p)];
            if (rlt >= k)
                goto found;
            res = rlt;
        }
        return puts ("-1"), 0;
        found : ;
        ans[p] = i;
        vis[i] = true;
        k -= res;
        if (i == p)
            -- m;
    }
    for (int i = 1;i <= n;++ i)
        io::write (ans[i]), putchar (' ');
    puts ("");
    return 0;
}