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

#define ff first
#define ss second
#define pb push_back

typedef long long ll;
typedef long double lf;
typedef pair <ll,ll> pii;

const ll N = 35;
const ll S = 2010;
const ll LOG_N = 18;
const ll oo = 1e16+7;
const ll mod = 2e9 + 7;

__int128 dp[2][N][N][2 * N * N + 5];
int cnt[2][N][N][2 * N * N + 5];
int pas[2][N];
int many[2][N];
__int128 k = 0;
int idx = 0;
int n, b; 

__int128 go (int flag, int i, int j, int bal) {
  if (i == n) { 
    if (j == 0 && bal == b) return 1;
    return 0;
  }

  auto &rf = dp[flag][i][j][bal + N * N];

  if (cnt[flag][i][j][bal + N * N] == idx) return rf;
  cnt[flag][i][j][bal + N * N] = idx;

  if (pas[flag][i]) return rf = go(flag ^ 1, i + flag, j, bal);

  if (flag == 0) {
    int unmatch = (i ? many[1][i - 1] - (many[0][i - 1] - j) : 0);
    rf = go(1, i, j + 1, bal - i);
    if (unmatch) {
      __int128 add = k;
      if (go(1, i, j, bal + i) <= k / unmatch) 
        add = go(1, i, j, bal + i) * unmatch;
      
      if (rf <= k - add) 
        rf += add;
      else rf = k;
    }
  }
  else {
    rf = go(0, i + 1, j, bal - i);
    if (j) {
      __int128 add = k;
      if (go(0, i + 1, j - 1, bal + i) <= k / j)
        add = go(0, i + 1, j - 1, bal + i) * j;

      if (rf <= k - add)
        rf += add;
      else rf = k;
    }
  }

  return rf;
}

int main () {
        
  #ifdef LOCAL
  freopen("input.txt","r",stdin);
  #endif

  ios_base::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
  
  cin >> n >> b;
  string s; cin >> s;

  for (int i = 0; i < s.size(); ++i)
    k = 10 * k + s[i] - '0';

  vector <int> ans;
  vector <int> visi(n, 0);

  for (int i = 0; i < n; ++i) {
    pas[1][i] = 1;
    for (int j = 0; j < n; ++j) { 
      if (visi[j]) continue;
      idx++;
      pas[0][j] = 1;
      b -= abs(j - i);

      for (int flag = 0; flag < 2; ++flag) {
        for (int h = 0; h < n; ++h) {
          many[flag][h] = 1 - pas[flag][h];
          if (h) many[flag][h] += many[flag][h - 1];
        }
      }

      if (go(0, 0, 0, 0) >= k) { 
        ans.pb(j + 1);
        visi[j] = 1;
        break;
      }
      else k -= go(0, 0, 0, 0);

      b += abs(j - i);
      pas[0][j] = 0;
    }
  }

  for (auto &e : ans) cout << e << " ";
  cout << '\n';

  return 0;
}