//泥の分際で私だけの大切を奪おうだなん
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
using namespace std;
#define i128 __int128
inline i128 read(){
   i128 s=0,w=1;
   char ch=getchar();
   while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
   while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
   return s*w;
}
int n=read(),m=read()/2;
i128 k=read();
bool vis[33],tmp[33];
int a[33],b[33];
int lim[33];
i128 f[35][35][503];
int deg[33],in[33],IN[33];
map<vector<int>,__int128> mp;
i128 work()
{
	vector<int> O;
	for(int i=1; i<=n; ++i) O.push_back(b[i]);
	if(mp.count(O))
	{
		return mp[O];
	}
	memset(f,0,sizeof(f));
	for(int i=1; i<=n; ++i) deg[i]=in[i]=IN[i]=0;
	for(int i=1; i<=n; ++i)
		if(b[i]) ++deg[i],++deg[b[i]],in[i]=b[i],in[b[i]]=-i,
		++IN[min(i,b[i])],--IN[max(i,b[i])];
	f[0][0][0]=1;
	// for(int i=1; i<=n; ++i)
		// printf("%d ",b[i]);
	// puts("");
	// printf("* ");
	// for(int i=1; i<=n; ++i)
		// printf("%d ",IN[i]);
	// puts("");
	for(int i=1; i<=n; ++i)
	{
		int A=0,B=0;
		for(int j=1; j<=n; ++j)
			if(j<i&&b[j]&&b[j]>=i) ++A;
			else if(j>=i&&b[j]&&b[j]<i) ++B;
		for(int j=0; j<i; ++j)
			for(int k=0; k<=m; ++k) if(f[i-1][j][k])
			{
				if(deg[i]==0)
				{
					if(j-1>=0&&k+j-1<=m)
						f[i][j-1][k+j-1]+=f[i-1][j][k]*(j-A)*(j-B);
					if(k+j+1<=m)
						f[i][j+1][k+j+1]+=f[i-1][j][k];
					if(k+j<=m)
						f[i][j][k+j]+=f[i-1][j][k]*(j*2-A-B+1);
				}
				else if(deg[i]==1)
				{
					if(in[i]>0)
					{
						if(in[i]>i)
						{
							if(k+j<=m)
								f[i][j][k+j]+=f[i-1][j][k]*(j-A);
							if(k+j+1<=m)
								f[i][j+1][k+j+1]+=f[i-1][j][k];
						}
						else
						{
							if(k+j<=m)
								f[i][j][k+j]+=f[i-1][j][k];
							if(j-1>=0&&k+j-1<=m)
								f[i][j-1][k+j+1]+=f[i-1][j][k]*(j-A);
						}
					}
					else if(in[i]<0)
					{
						if(in[i]<-i)
						{
							if(k+j<=m)
								f[i][j][k+j]+=f[i-1][j][k]*(j-B);
							if(k+j+1<=m)
								f[i][j+1][k+j+1]+=f[i-1][j][k];
						}
						else
						{
							if(k+j<=m)
								f[i][j][k+j]+=f[i-1][j][k];
							if(j-1>=0&&k+j-1<=m)
								f[i][j-1][k+j-1]+=f[i-1][j][k]*(j-B);
						}
					}
					else assert(0);
				}
				else
				{
					if(j+IN[i]/2>=0&&k+j+IN[i]/2<=m)
						f[i][j+IN[i]/2][k+j+IN[i]/2]+=f[i-1][j][k];
				}
			}
	}
	// printf("result %lld\n",(long long)f[n][0][m]);
	return mp[O]=f[n][0][m];
}
i128 solve()
{
	memset(tmp,0,sizeof(tmp));
	for(int i=1; i<=n; ++i) b[i]=0;
	i128 ans=0;
	for(int i=1; i<=n; ++i) //first !=
	{
		for(int j=1; j<a[i]; ++j)
			if(!tmp[j])
			{
				b[i]=j;
				ans+=work();
			}
		b[i]=a[i];
		tmp[a[i]]=1;
	}
	// for(int i=1; i<=n; ++i) printf("%d ",a[i]);
	// printf("%lld\n",(long long)ans);
	return ans;
}
signed main()
{
	// printf("%lld\n",(long long)work());
	for(int i=1; i<=n; ++i)
	{
		int last=-1;
		for(int j=1; j<=n; ++j) if(!vis[j])
		{
			a[i]=j;
			vis[j]=1;
			for(int k=1,p=i; k<=n; ++k)
				if(!vis[k]) a[++p]=k;
			vis[j]=0;
			if(solve()>=k) break;
			last=j;
		}
		assert(last!=-1);
		a[i]=last,vis[last]=1;
	}
	for(int i=1; i<=n; ++i)
		printf("%d ",a[i]);
	puts("");
	return 0;
}