#include<bits/stdc++.h>
using std::cin;
using std::cout;
using ll = long long;
using i128 = __int128;
const int N = 35;
int n, b;
i128 k;

i128 dp[N * 2][N][N][N * N / 2];
i128 calc(std::vector<std::pair<int, int>> v, int b) {
	if(b < 0) return 0;
	int n = v.size();
	int c0 = 0;
	int c1 = 0;
	dp[0][0][0][0] = 1;
	for(int i = 0;i < n;++i) {
		auto [c, col] = v[i];
		int s = 0;
		if(i) s = v[i].first - v[i - 1].first;
		assert(s >= 0);
		for(int x = 0;x <= c0;++x) {
			for(int y = 0;y <= c1;++y) {
				const int add = s * (x + y);
				if(col) {
					for(int z = 0;z + add <= b;++z) {
						dp[i + 1][x][y + 1][z + s * (x + y)] += dp[i][x][y][z];
					}
					if(x > 0) {
						for(int z = 0;z + add <= b;++z) {
							dp[i + 1][x - 1][y][z + s * (x + y)] += dp[i][x][y][z] * x;
						}
					}
				} else {
					for(int z = 0;z + add <= b;++z) {
						dp[i + 1][x + 1][y][z + s * (x + y)] += dp[i][x][y][z];
					}
					if(y > 0) {
						for(int z = 0;z + add <= b;++z) {
							dp[i + 1][x][y - 1][z + s * (x + y)] += dp[i][x][y][z] * y;
						}
					}
				}
			}
		}
		++ (col ? c1 : c0);
	}
	i128 res = dp[n][0][0][b];
	for(int i = 0;i <= n;++i) {
		for(int x = 0;x <= c0;++x) {
			for(int y = 0;y <= c1;++y) {
				memset(dp[i][x][y], 0, (b + 1) * sizeof(i128));
			}
		}
	}
	return res;
}
int ans[N];

void getk(int i, int mask, int sum, i128 k) {
	if(i == n) {
		for(int x = 0;x < n;++x) {
			cout << ans[x] + 1 << " \n"[i == n - 1];
		}
		return ;
	}
	for(int x = 0;x < n;++x) {
		if(mask >> x & 1) {
			ans[i] = x;
			int _sum = sum + std::abs(x - i);
			std::vector<std::pair<int, int>> v;
			for(int z = i + 1;z < n;++z) {
				v.emplace_back(z, 0);
			}
			for(int z = 0;z < n;++z) if((mask >> z & 1) && z != x) {
				v.emplace_back(z, 1);
			}
			sort(v.begin(), v.end());

			i128 count = calc(v, b - _sum);
			if(k > count) {
				k -= count;
			} else {
				ans[i] = x;
				getk(i + 1, mask ^ (1 << x), _sum, k);
				return ;
			}
		}
	}
}

int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
//	printf("%d\n", sizeof(dp) >> 20);
	std::string s;
	cin >> n >> b >> s;
	for(char c : s) k = k * 10 + (c & 15);
	/*
	std::vector<std::pair<int, int>> v;
	for(int i = 0;i < n;++i) {
		v.emplace_back(i, 0);
		v.emplace_back(i, 1);
	}
	cout << (ll) calc(v, b) << '\n';
	*/
	getk(0, (1 << n) - 1, 0, k);
}