#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#define ff first
#define ss second
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef __int128 dll;

const int MAXN = 30;

int N, B, A[MAXN+10], AP[MAXN+10];
bool chk[MAXN+10], vis[MAXN+10];
dll K;

dll dp[MAXN+10][MAXN+10][MAXN*MAXN+10];
dll f[MAXN+10][MAXN+10], g[MAXN+10];

dll getdp(int h, int comp, int sum)
{
	if(!(1<=h && h<=N+1)) return 0;
	if(!(0<=comp && comp<=N)) return 0;
	if(!(0<=sum && sum<=N*N)) return 0;
	return dp[h][comp][sum];
}

dll solve(int p) // chosen for i<=p
{
	if(p==N+1) return 1;
	int val=0;
	int cnt=0, cnt2=0;
	for(int i=1; i<=N; i++) vis[i]=0;
	for(int i=1; i<=p; i++)
	{
		if(A[i]>p)
		{
			cnt++;
			val+=abs(p+1-i);
			vis[A[i]]=1;
		}
		else val+=abs(A[i]-i);

		if(AP[i]==0)
		{
			val+=abs(p+1-i);
		}
	}
	cnt2=cnt;
	// printf("!%d %d\n", cnt, val);

	dp[N+1][0][B-val]=1;
	cnt=0;
	for(int h=N; h>p; h--)
	{
		if(vis[h]) cnt++;
		for(int comp=cnt; comp<=N; comp++)
		{
			for(int sum=0; sum<=N*N; sum++)
			{
				dp[h][comp][sum]=0;

				if(!vis[h])
				{
					dp[h][comp][sum]+=getdp(h+1, comp, sum+2*comp);
					dp[h][comp][sum]+=getdp(h+1, comp+1, sum+2*(comp+1))*(comp+1);
					dp[h][comp][sum]+=getdp(h+1, comp, sum+2*comp)*(comp*2-cnt);
					dp[h][comp][sum]+=getdp(h+1, comp-1, sum+2*(comp-1))*(comp-cnt);
				}
				else
				{
					dp[h][comp][sum]+=getdp(h+1, comp, sum+2*comp);
					dp[h][comp][sum]+=getdp(h+1, comp-1, sum+2*(comp-1));
				}
				// printf("%d %d %d : %lld\n", h, comp, sum, (ll)dp[h][comp][sum]);
			}
		}
	}
	dp[N+1][0][B-val]=0;

	dll ret=dp[p+1][cnt2][0]*g[cnt2];
	// for(int i=1; i<=p; i++) printf("%d ", A[i]); printf("\n");
	// for(int i=1; i<=p; i++) printf("%d ", AP[i]); printf("\n");
	// printf(" : %lld\n\n", (ll)ret);
	return ret;

}

int main() {
	cin.tie(0); ios_base::sync_with_stdio(0);
	
	string SK;
	cin>>N>>B>>SK;
	for(int i=0; i<SK.size(); i++) K=K*10+(SK[i]-'0');

	f[1][1]=1;
	for(int i=2; i<=N; i++)
	{
		for(int j=1; j<=i; j++)
		{
			f[i][j]=f[i-1][j-1]+f[i-1][j]*(i-1);
		}
	}
	g[0]=1;
	for(int i=1; i<=N; i++) for(int j=1; j<=i; j++) g[i]+=f[i][j];

	for(int i=1; i<=N; i++)
	{
		for(int j=1; j<=N; j++)
		{
			if(chk[j]) continue;
			A[i]=j;
			AP[j]=i;
			dll t=solve(i);
			if(t<K)
			{
				K-=t;
				AP[j]=0;
			}
			else
			{
				chk[j]=true;
				break;
			}
		}
	}
	for(int i=1; i<=N; i++) printf("%d ", A[i]); printf("\n");
}