#include<bits/stdc++.h>
#define int long long
#define ull unsigned long long
#define maxn 1000005
#define put() putchar('\n')
#define Tp template<typename Ty>
#define Ts template<typename Ty,typename... Ar>
using namespace std;
void read(int &x){
    int f=1;x=0;char c=getchar();
    while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
    while (c>='0'&&c<='9') {x=x*10+c-'0';c=getchar();}
    x*=f;
}
namespace Debug{
	Tp void _debug(char* f,Ty t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,Ty x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	Tp ostream& operator<<(ostream& os,vector<Ty>& V){os<<"[";for(auto& vv:V) os<<vv<<",";os<<"]";return os;}
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
}using namespace Debug;
#define fi first
#define se second
#define mk make_pair
const int mod=1e9+7;
int power(int x,int y=mod-2) {
	int sum=1;
	while (y) {
		if (y&1) sum=sum*x%mod;
		x=x*x%mod;y>>=1;
	}
	return sum;
}
int n,m,k;
vector<int> gen(int S,int n) {
	vector<int>a;int i;
	for (i=n-1;i>=0;i--) a.push_back((S>>i)&1);
	return a; 
}
int calc(vector<int>a,int n) {
	int ans=0,i;
	for (i=0;i<n;i++) {
		int j=1;
		while (i-j>=0&&i+j<=n-1&&a[i-j]==a[i+j]) j++;
		ans+=j;
	}
	for (i=1;i<n;i++) if (a[i]==a[i-1]) {
		int j=1;
		while (i-j-1>=0&&i+j<=n-1&&a[i-j-1]==a[i+j]) j++;
		ans+=j;
	}
	return ans;
} 
void solve(void) {
	int N=min(n,6ll),i,j,Min=1e9;
	for (i=0;i<(1<<N);i++) Min=min(Min,calc(gen(i,N),N));
	for (i=0;i<(1<<N);i++) {
		int tmp=calc(gen(i,N),N);
		if (tmp==Min) {
			if (!(--k)) {
				vector<int>a=gen(i,N);
				for (j=0;j<n;j++) printf("%d ",a[j%N]+1);
				exit(0);
			}
		}
	}
	puts("-1");
}
int ans[maxn],pw[maxn];
void print(int id,int res) {
	int i;
//	gdb(id,res,ans[id-1]);
	for (i=id;i<=n;i++) {
//		gdb(i,res,pw[i]);
		int nums=(res+pw[i]-1)/pw[i],t=nums;
		if (i>=2&&t>=min(ans[i-1],ans[i-2])) t++;
		if (i>=3&&t>=max(ans[i-1],ans[i-2])) t++;
		ans[i]=t;
		res=res-(nums-1)*pw[i];
	}
	for (i=1;i<=n;i++) printf("%lld ",ans[i]);
	exit(0);
}
signed main(void){
	int i;
	read(n);read(m);read(k);
	if (m==1) {
		if (k>1) puts("-1");
		else {
			for (i=1;i<=n;i++) printf("%d ",1);
		}
		return 0;
	}
	if (m==2) {
		solve();
		return 0;
	}
	int res=1;
	ans[0]=1e9;
	for (i=1;i<=n;i++) ans[i]=(i-1)%3+1;
	for (i=n;i>=1;i--) {
		int tmp=m-2+(i<=2)+(i<=1);
		pw[i]=res;
		if ((long double)tmp*res>=k) {
			int nums=(k+res-1)/res,t=nums;
//			gdb(i,nums);
			if (i>=2&&t>=min(ans[i-1],ans[i-2])) t++;
			if (i>=3&&t>=max(ans[i-1],ans[i-2])) t++;
			ans[i]=t;
			print(i+1,k-(nums-1)*res);
		}
		else res=res*tmp;
	}
	puts("-1");
	return 0;
}