#include <bits/stdc++.h>

using namespace std;

using u128 = __uint128_t;

u128 mem[30][30][30][256], k;
int n, b, ans[30], l, m;

u128 cnt(int l, int c, int d, int b, int m) {
  if (l == n) return !b & !c & !d;
  auto& ans = mem[l][c][d][b];
  if (~ans) return ans;
  if ((m & 1 << l) && d) {
    ans += cnt(l + 1, c - 1, d - 1, b - c + 1, m) * c * d;
    ans += cnt(l + 1, c, d, b - c, m) * d;
  }
  if (c += m >> l & 1) ans += cnt(l + 1, c - 1, d, b - c + 1, m) * c;
  return ++ans += cnt(l + 1, c, d + 1, b - c, m);
}

u128 cnt(int l, int b, int m) {
  int c = 0;
  for (int i = 0; i < l; ++i) if (m & 1 << i) ++c, b -= l - i;
  fill(***mem, **mem[30], -1);
  return cnt(l, c, 0, b, m);
}

int main() {
  cin >> n >> b; b /= 2;
  for (char c; cin >> c; ) k = k * 10 + c - '0';
  while (l < n)
  for (int i = 0; i < n; ++i) if (~m & 1 << i) if (auto t = cnt(l + 1, b - max(l - i, {}), ~m - (1 << i)); t >= k) {
    b -= max(l - i, {});
    ans[l++] = i + 1;
    m += 1 << i;
    break;
  } else k -= t;
  for (int i = 0; i < n; ++i) cout << ans[i] << ' ';
}