#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int n,m;
ll k;

int a[2333];
vector <int> SS;
void constr(int N){
	int l,r,bst = inf,cur;
	rep(S,0,(1 << N) - 1){
		rep(i,0,N - 1) a[i + 1] = (S >> i) & 1;
		cur = 0;
		rep(i,1,N){
			l = r = i;
			cur++;
			while(l > 1 && r < N && a[l - 1] == a[r + 1]){
				l--;r++;
				cur++;
			}
		} 
		rep(i,1,N - 1){
			l = i + 1;r = i;
			while(l > 1 && r < N && a[l - 1] == a[r + 1]){
				l--;r++;
				cur++;
			}
		}
		if(cur < bst){
			bst = cur;
			SS.clear();
		}
		if(cur == bst) SS.eb(S);
	}
}

int ans[1000005];
void solve2(){
	constr(min(n,10));
	if(k > SZ(SS)){
		printf("-1\n");
		return;
	}	
	int sz = min(n,10);
	per(i,sz - 1,0) ans[i + 1] = ((SS[k - 1] >> i) & 1) + 1;
	reverse(ans + 1,ans + sz + 1);
	rep(i,1,n){
		if(i > sz) ans[i] = ans[i - 6];
		printf("%d ",ans[i]);
	}
	printf("\n");
}

#define lll __int128
ll mul(ll x,ll y){
	lll ret = (lll)x * y;
	if(ret > linf) return linf;
	return ret;
}

ll base[1000005];
int main(){
//	freopen("test.in","r",stdin);
	scanf("%d%d%lld",&n,&m,&k);
	if(m == 1){
		if(k == 1){
			rep(i,1,n) printf("1 ");
			printf("\n");
		}else{
			printf("-1\n");
		}
		return 0;
	}
	if(m == 2){
		solve2();
		return 0;
	}
	base[n + 1] = 1; 
	per(i,n,1) base[i] = mul(base[i + 1],m + 1 - min(3,i));
	k--;
	if(k >= base[1]){
		printf("-1\n");
		return 0;
	}
	rep(i,1,n){
		ans[i] = 1 + k / base[i + 1];
		k %= base[i + 1];
		if(i >= 2 && ans[i] >= ans[i - 1]){
			ans[i]++;
			if(i >= 3 && ans[i] >= ans[i - 2]) ans[i]++;
		}else{
			if(i >= 3 && ans[i] >= ans[i - 2]){
				ans[i]++;
				if(i >= 2 && ans[i] >= ans[i - 1]) ans[i]++;
			}
		}
		printf("%d ",ans[i]);
	}
	printf("\n");
	return 0;
}