#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define mod 998244353
#define ll long long
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
inline __int128 read()
{
	char ch=getchar(); int nega=1; while(!isdigit(ch)) {if(ch=='-') nega=-1; ch=getchar();}
	__int128 ans=0; while(isdigit(ch)) {ans=ans*10+ch-48;ch=getchar();}
	if(nega==-1) return -ans;
	return ans;
}
void print(vector<int> x){for(int i=0;i<(int)x.size();i++) printf("%d%c",x[i]," \n"[i==(int)x.size()-1]);}
typedef __int128 i128;
#define N 35
i128 f[N][N][N*N*2],g[N][N][N*N*2],rk;
int n,b,a[N],rev[N],vis[N],hav[N][N],havg[N][N];
i128 calc()
{
	memset(f,0,sizeof(f));
	f[0][0][n*n]=1,hav[0][0]=1;
	for(int i=0;i<n;i++)
	{
		memset(havg,0,sizeof(havg));
		for(int c=0;c<=i;c++) for(int d=0;d<=i;d++) if(hav[c][d])
		{
			for(int k=0;k<N*N;k++) if(f[c][d][k])
			{
				if(a[i+1]&&rev[i+1])
				{
					int nk=k;
					if(a[i+1]<i+1) nk+=i+1;
					else nk-=i+1;
					if(rev[i+1]<=i+1) nk+=i+1;
					else nk-=i+1;
					g[c][d][nk]+=f[c][d][k];
					havg[c][d]=1;
				}
				else if(a[i+1])
				{
					int nk=k;
					if(a[i+1]<i+1) nk+=i+1;
					else nk-=i+1;
					if(c) g[c-1][d][nk+i+1]+=f[c][d][k]*c,havg[c-1][d]=1;
					g[c][d+1][nk-i-1]+=f[c][d][k],havg[c][d+1]=1;
				}
				else if(rev[i+1])
				{
					int nk=k;
					if(rev[i+1]<=i+1) nk+=i+1;
					else nk-=i+1;
					if(d) g[c][d-1][nk+i+1]+=f[c][d][k]*d,havg[c][d-1]=1;
					g[c+1][d][nk-i-1]+=f[c][d][k],havg[c+1][d]=1;
				}
				else
				{
					g[c][d][k]+=f[c][d][k],havg[c][d]=1;
					if(c&&d) g[c-1][d-1][k+2*(i+1)]+=c*d*f[c][d][k],havg[c-1][d-1]=1;
					if(c) g[c][d][k]+=c*f[c][d][k];
					if(d) g[c][d][k]+=d*f[c][d][k];
					g[c+1][d+1][k-2*(i+1)]+=f[c][d][k],havg[c+1][d+1]=1;
				}
			}
		}
		memcpy(hav,havg,sizeof(hav));
		for(int c=0;c<=i+1;c++) for(int d=0;d<=i+1;d++)
		{
			if(hav[c][d]) memcpy(f[c][d],g[c][d],sizeof(f[c][d])),memset(g[c][d],0,sizeof(g[c][d]));
		}
		// for(int c=0;c<=i;c++) for(int d=0;d<=i;d++) for(int k=0;k<N*N;k++) if(f[c][d][k])
		// {
			// printf("f[%d][%d][%d][%d] = %d\n",i+1,c,d,k-n*n,(int)f[c][d][k]);
		// }
	}
	return f[0][0][n*n+b];
}
signed main()
{
	// cout<<sizeof(f)/1024.0/1024.0<<endl;
	cin>>n>>b; rk=read();
	// a[1]=1,rev[1]=1,a[2]=2,rev[2]=2;
	// a[3]=6,rev[6]=3;
	// long long res=calc();
	// cout<<res<<endl;
	// return 0;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=n;j++) if(!rev[j])
		{
			a[i]=j;
			rev[j]=i;
			i128 cnt=calc();
			// printf("%d %d %lld\n",i,j,(long long)cnt);
			if(cnt<rk) rk-=cnt;
			else break;
			rev[j]=0;
		}
	}
	for(int i=1;i<=n;i++) printf("%d%c",a[i]," \n"[i==n]);
	return 0;
}