#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

// using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


#ifndef LIBRA_OTHER_INT128_H_
#define LIBRA_OTHER_INT128_H_

#include <stdio.h>
#include <iostream>

constexpr unsigned __int128 toUInt128(const char *s) {
  unsigned __int128 x = 0;
  for (; *s; ++s) x = x * 10 + (*s - '0');
  return x;
}
constexpr __int128 toInt128(const char *s) {
  if (*s == '-') return -toInt128(s + 1);
  __int128 x = 0;
  for (; *s; ++s) x = x * 10 + (*s - '0');
  return x;
}
unsigned __int128 inUInt128() {
  static char buf[41];
  scanf("%s", buf);
  return toUInt128(buf);
}
__int128 inInt128() {
  static char buf[41];
  scanf("%s", buf);
  return toInt128(buf);
}

void out(unsigned __int128 x) {
  static char buf[41];
  int len = 0;
  do { buf[len++] = '0' + static_cast<int>(x % 10); } while (x /= 10);
  for (int i = len; --i >= 0; ) putchar(buf[i]);
}
void out(__int128 x) {
  if (x < 0) {
    putchar('-');
    out(-static_cast<unsigned __int128>(x));
  } else {
    out(static_cast<unsigned __int128>(x));
  }
}
std::ostream &operator<<(std::ostream &os, unsigned __int128 x) {
  static char buf[41];
  int len = 0;
  do { buf[len++] = '0' + static_cast<int>(x % 10); } while (x /= 10);
  for (int i = len; --i >= 0; ) os << buf[i];
  return os;
}
std::ostream &operator<<(std::ostream &os, __int128 x) {
  if (x < 0) {
    os << '-' << -static_cast<unsigned __int128>(x);
  } else {
    os << static_cast<unsigned __int128>(x);
  }
  return os;
}

#endif  // LIBRA_OTHER_INT128_H_


using INT = __int128;

int N;
vector<int> P;

// val, match, cost
INT dp[70][40][2010];

INT solve(int B) {
  if (B < 0) return false;
  vector<int> used(N, 0);
  for (int i = 0; i < N; ++i) if (~P[i]) {
    used[P[i]] = 1;
  }
  vector<pair<int, int>> es;
  for (int i = 0; i < N; ++i) {
    if (!~P[i]) es.emplace_back(i, 0);
    if (!used[i]) es.emplace_back(i, 1);
  }
  const int esLen = es.size();
  fill(dp[0][0], dp[0][0] + (B + 1), 0);
  dp[0][0][0] = 1;
  int xs[2] = {};
  int last = 0;
  for (int h = 0; h < esLen; ++h) {
    const int z = min(xs[0], xs[1]);
    for (int m = 0; m <= z + 2; ++m) {
      fill(dp[h + 1][m], dp[h + 1][m] + (B + 1), 0);
    }
    const int s = es[h].second;
    for (int m = 0; m <= z; ++m) {
      const int db = (es[h].first - last) * ((xs[0] - m) + (xs[1] - m));
      for (int b = 0; b + db <= B; ++b) if (dp[h][m][b]) {
        dp[h + 1][m][b + db] += dp[h][m][b];
        dp[h + 1][m + 1][b + db] += dp[h][m][b] * (xs[s ^ 1] - m);
      }
    }
    ++xs[s];
    last = es[h].first;
  }
  assert(xs[0] == xs[1]);
  const INT ret = dp[esLen][xs[0]][B];
if(N<=6)cerr<<COLOR("33")<<"[solve] "<<P<<" "<<B<<" = "<<ret<<COLOR()<<endl;
  return ret;
}

int main() {
  int B;
  INT K;
  for (; ~scanf("%d%d", &N, &B); ) {
    K = inInt128();
    
    P.assign(N, -1);
solve(B);
    int b = B;
    INT k = K;
    for (int i = 0; i < N; ++i) {
      const set<int> used(P.begin(), P.begin() + i);
      for (int a = 0; a < N; ++a) if (!used.count(a)) {
        P[i] = a;
        const INT res = solve(b - abs(a - i));
        if (k > res) {
          k -= res;
        } else {
          goto found;
        }
      }
      assert(false);
     found:{}
      b -= abs(P[i] - i);
    }
    
    for (int i = 0; i < N; ++i) {
      if (i) printf(" ");
      printf("%d", P[i] + 1);
    }
    puts("");
  }
  return 0;
}