#include <iostream>
#include <vector>

using namespace std;

int n, k, p, a[33][33], s;

int main() {
    s = 1;
    cin >> n >> k >> p;
    for(int i = 0; i <= n; i++) {
        a[i][0] = a[i][i] = 1;
        for(int j = 1; j < i; j++) {
            a[i][j] = a[i - 1][j - 1] + a[i - 1][j];
        }
    }
    vector<int> b;
    while(k) {
        if(a[n - 1][k - 1] > p) {
            b.push_back(s);
            k--;
        } else {
            p -= a[n - 1][k - 1];
        }
        n--;
        s++;
    }
    for(int i = 0; i < b.size(); i++) {
        cout << b[i] << " ";
    }
    cout << endl;
    return 0;
}