#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef array<int, 3> ai3;
const int inf = 0x3f3f3f3f;
//const ll INF = 0x3f3f3f3f3f3f3f3fll;
typedef __int128 lll;
const lll INF = ((lll)1) << 120;
inline void uadd(lll &a, lll b){ a += b; if(a >= INF) a = INF; }
inline lll mul(lll a, lll b){ if(!a || !b) return 0; if(a > INF / b) return INF; return min(INF, a * b); }
inline void umul(lll &a, lll b){ a = mul(a, b); }
const double pi = acos(-1);
template<typename T> inline void chmax(T &_a, T _b){ (_a<_b) ? (_a=_b) : 0; }
template<typename T> inline void chmin(T &_a, T _b){ (_b<_a) ? (_a=_b) : 0; }
mt19937_64 rng(58);
inline int myrand(int l, int r){ return (int)(rng() % (r-l+1)) + l; }

int n, b; lll k; string tmp;

int p[33], ip[33];

lll calc(){
	//cerr << "--------calc "; rep(i, n) cerr << p[i] << " "; cerr << "----------" << endl;
	static lll dp[33][16][255];
	memset(dp, 0, sizeof(dp));
	dp[0][0][0] = 1;
	int has0 = 0, has1 = 0;
	rep(i, n){
		//cerr << ". " << has0 << " " << has1 << endl;
		rep(j, min(i+1, n-i+1)){
			rep(s, 250) if(dp[i][j][s]){
				//cerr << i << " " << j << " " << s << ": " << (ll)dp[i][j][s] << endl;
				if(j && p[i] < i && ip[i] < i){
					//cerr << "?? " << (j - has0) << " " << (j - has1) << "\n";
					uadd(dp[i+1][j-1][s+j], mul(mul(dp[i][j][s], (p[i] < 0) ? (j - has1) : 1), (ip[i] < 0) ? (j - has0) : 1));
				}
				if((p[i] < 0 || p[i] > i) && (ip[i] < 0 || ip[i] > i))
					uadd(dp[i+1][j+1][s+j], dp[i][j][s]);
				if(p[i] < i && (ip[i] < 0 || ip[i] > i))
					uadd(dp[i+1][j][s+j], mul(dp[i][j][s], (p[i] < 0) ? (j - has1) : 1));
				if(ip[i] < i && (p[i] < 0 || p[i] > i))
					uadd(dp[i+1][j][s+j], mul(dp[i][j][s], (ip[i] < 0) ? (j - has0) : 1));
				if((p[i] < 0 && ip[i] < 0) || p[i] == i)
					uadd(dp[i+1][j][s+j], dp[i][j][s]);
			}
		}
		has0 += (p[i] > i) - (ip[i] >= 0 && ip[i] < i), has1 += (ip[i] > i) - (p[i] >= 0 && p[i] < i);
	}
	//cerr << (ll)dp[n][0][b / 2] <<endl;
	return dp[n][0][b / 2];
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> n >> b >> tmp;
	k = 0;
	rep(i, (int)tmp.size()) k = k * 10 + (tmp[i] - '0');

	memset(p, -1, sizeof(p)), memset(ip, -1, sizeof(ip));
	rep(i, n){
		for(int x = 0; x < n; ++x){
			if(ip[x] < 0){
				//cerr << i << " " << x << endl;
				ip[x] = i, p[i] = x;
				lll ret = calc();
				if(ret >= k) break;
				k -= ret;
				//cerr << (ll)k << endl;
				p[i] = -1, ip[x] = -1;
			}
		}
	}

	rep(i, n) cout << p[i]+1 << " ";
	cout << "\n";

	return 0;
}