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

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define test cout<<"test"<<endl;
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T>
void chmin(T &a,T b){if(a>b)a=b;}
template<typename T>
void chmax(T &a,T b){if(a<b)a=b;}
void pmod(ll &a,ll b){a=(a+b)%MOD;}
void pmod(ll &a,ll b,ll c){a=(b+c)%MOD;}
void qmod(ll &a,ll b){a=(a*b)%MOD;}
void qmod(ll &a,ll b,ll c){a=(b*c)%MOD;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,0,-1,0,1,1,-1,-1};
vector<ll>dy={0,1,0,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}
ostream &operator<<(ostream &os, pair<ll, ll>&p){
  return os << p.first << " " << p.second;
}  
#ifdef LOCAL
#include <debug_print.hpp>
#define OUT(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define OUT(...) (static_cast<void>(0))
#endif
  std::ostream &operator<<(std::ostream &dest, __int128_t value) {
    std::ostream::sentry s(dest);
    if (s) {
      __uint128_t tmp = value < 0 ? -value : value;
      char buffer[128];
      char *d = std::end(buffer);
      do {
        --d;
        *d = "0123456789"[tmp % 10];
        tmp /= 10;
      } while (tmp != 0);
      if (value < 0) {
        --d;
        *d = '-';
      }
      int len = std::end(buffer) - d;
      if (dest.rdbuf()->sputn(d, len) != len) {
        dest.setstate(std::ios_base::badbit);
      }
    }
    return dest;
  }
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n;cin>>n;
  ll b;cin>>b;
  using I=__int128_t;
  I k=0;
  {
    string s;cin>>s;
    for(auto c:s){
      k=k*10+c-'0';
    }
  }
  auto calc=[&](vector<int>p)->I {
    //prefixがpのときの数え上げ
    auto dp=make_v(n+1,n+1,b+1,I(0));
    dp[0][0][0]=1;
    p.resize(n,-1);
    vector<int>q(n,-1);
    rep(i,0,n){
      //OUT(p,i);
      if(p[i]!=-1)q[p[i]]=i;
    }
    ll hozl=0,hozr=0;
    //OUT(p,q);
    rep(i,0,n){
      bool no_match=true;
      if(p[i]!=-1&&p[i]<=i)no_match=false;
      if(q[i]!=-1&&q[i]<=i)no_match=false;
      bool soon=(p[i]==i||(p[i]==-1&&q[i]==-1));
      rep(j,0,n+1){
        rep(o,0,b+1){
          if(o+j*2>b)break;
          if(dp[i][j][o]==0)continue;
          if(j<n&&no_match){
            dp[i+1][j+1][o+j*2]+=dp[i][j][o]; //マッチングなし
          }
          if(soon)dp[i+1][j][o+j*2]+=dp[i][j][o]; //即マッチング
          if(p[i]!=i){
            ll lf=0;
            if(p[i]==-1)lf=j-hozr;
            else if(p[i]<i)lf=1;
            if(q[i]==-1||q[i]>i)dp[i+1][j][o+j*2]+=dp[i][j][o]*lf; //index側のみマッチング
            ll rf=0;
            if(q[i]==-1)rf=j-hozl;
            else if(q[i]<i)rf=1;
            //OUT(i,j,o,lf,rf);
            if(p[i]==-1||p[i]>i)dp[i+1][j][o+j*2]+=dp[i][j][o]*rf; //val側マッチング
            if(j>0)dp[i+1][j-1][o+j*2]+=dp[i][j][o]*lf*rf; //両方マッチング
          }
        }
      }
      if(p[i]!=-1){
        if(p[i]>i)hozl++;
        else if(p[i]<i)hozr--;
      }
      if(q[i]!=-1){
        if(q[i]>i)hozr++;
        else if(q[i]<i)hozl--;
      }
      //OUT(hozl,hozr,i,p[i],q[i]);
    }
    //OUT(dp);
    return dp[n][0][b];
  };
  vector<int>ret;
  // OUT(calc(ret));
  // rep(i,0,n){
  //   ret.PB(i);
  //   res+=calc(ret);
  //   OUT(i,res);
  //   ret.pop_back();
  // }
  //OUT(res);exit(0);
  vector<bool>used(n);
  rep(i,0,n){
    vector<int>tmp=ret;
    rep(j,0,n){
      if(used[j])continue;
      tmp.PB(j);
      auto cl=calc(tmp);
      //OUT(tmp,k,cl);
      if(cl>=k){
        ret.PB(j);
        used[j]=true;
        break;
      }
      tmp.pop_back();
      k-=cl;
    }
  }
  for(auto &z:ret)z++;
  debug(ret,ret.size());
  return 0;
}