#include <iostream>

using LLL = __int128_t;

int n, b;
LLL k;
void read(LLL &x){
	// read a __int128 variable
	char c; bool f = 0;
	while(((c = getchar()) < '0' || c > '9') && c != '-');
	if(c == '-'){f = 1; c = getchar();}
	x = c - '0';
	while((c = getchar()) >= '0' && c <= '9')x = x * 10 + c - '0';
	if(f) x = -x;
}

bool el[37], er[37];
int ul[37], ur[37];
LLL dp[37][37][907];

void DP() {
  for (int i = 0; i <= n; ++i) {
    for (int j = 0; j <= i; ++j) {
      for (int k = 0; k <= i * i; ++k) {
        dp[i][j][k] = 0;
      }
    }
  }
  dp[0][0][0] = 1;
  for (int i = 1; i <= n; ++i) {
    ul[i] = ul[i - 1] + el[i], ur[i] = ur[i - 1] + er[i];
  }
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j <= i; ++j) {
      for (int k = 0; k <= i * i; ++k) {
        int lc = j, rc = ur[i] - (ul[i] - j);
        int kk = k + lc + rc;
        // 左部右部都不匹配
        dp[i + 1][lc + el[i + 1]][kk] += dp[i][j][k]; 
        if (el[i + 1] && rc) {
          // 选右部一个线头和左部的 i + 1 匹配，右部 i + 1 不匹配 
          dp[i + 1][lc][kk] += dp[i][j][k] * rc;
        }
        if (er[i + 1] && lc) {
          // 选左部一个线头和右部的 i + 1 匹配，左部 i + 1 不匹配 
          dp[i + 1][lc - 1 + el[i + 1]][kk] += dp[i][j][k] * lc;
        }
        if (el[i + 1] && er[i + 1]) {
          if (lc && rc) {
            // 选左部一个线头和右部的 i + 1 匹配，选右部一个线头和左部的 i + 1 匹配
            dp[i + 1][lc - 1][kk] += dp[i][j][k] * lc * rc;
          }
          // 左部和右部匹配
          dp[i + 1][lc][kk] += dp[i][j][k];
        }
      }
    }
  }
}

int p[37];
LLL prefix[37];

int main() {
  std::cin >> n >> b, read(k);
  for (int i = 1; i <= n; ++i) {
    el[i] = er[i] = 1;
  }
  for (int i = 1; i <= n; ++i) {
    el[i] = 0;
    for (int j = 1; j <= n; ++j) {
      prefix[j] = prefix[j - 1];
      if (er[j] == 0 || std::abs(i - j) > b) {
        continue;
      }
      er[j] = 0;
      DP();
      prefix[j] += dp[n][0][b - std::abs(i - j)];
      if (k <= prefix[j]) {
        p[i] = j;
        k -= prefix[j - 1], b -= std::abs(i - j);
        break;
      }
      er[j] = 1;
    }
  }
  for (int i = 1; i <= n; ++i) {
    std::cout << p[i] << ' ';
  }
  std::cout << '\n';
  return 0;
}