#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
#pragma GCC target("avx,avx2,sse,sse2")
#define all(x) begin(x), end(x)
using namespace std;
using ll = long long;

int get(int msk, int bit) { return (msk>>bit)&1; }
int longest(int n, int msk) {
	int ans = 0;
	for(int i = 0; i < n; i++) {
		int l = 0;
		while(i-l >= 0 && i+l < n && get(msk, i-l) == get(msk, i+l)) l++;
		l--;
		ans = max(ans, 2*l+1);
	}
	for(int i = 0; i + 1 < n; i++) {
		int l = 0;
		while(i-l >= 0 && i+1+l < n && get(msk, i-l) == get(msk, i+1+l)) l++;
		l--;
		ans = max(ans, 2*l+2);
	}
	return ans;
}

vector<int> cur;
int limit = 4;
void dfs(int pos, uint8_t msk, ll &n, ll &k) {
	if(longest(min(pos, 6), msk) > limit) return;
	if(pos == n) {
		if(k) k--;
		else {
			for(auto i : cur) cout << i << " ";
			exit(0);
		}
		return;
	}
	for(int d = 0; d < 2; d++) {
		cur.push_back(d);
		dfs(pos+1, 2*msk+d, n, k);
		cur.pop_back();
	}
}

int main() {
	cin.tie(0)->sync_with_stdio(0);
	// for(int n = 1; n <= 25; n++) {
	// 	int x = n, y = 0;
	// 	for(int msk = 0; msk < 1<<n; msk++)
	// 		x = min(x, longest(n, msk));
	// 	for(int msk = 0; msk < 1<<n; msk++)
	// 		y += longest(n, msk) == x;
	// 	cout << n << " : " << x << " " << y << endl;
	// }
	ll n, m, k;
	cin >> n >> m >> k;
	if(m == 1) {
		if(k > 1) cout << "-1\n";
		else for(int i = 0; i < n; i++) cout << "1 ";
		return 0;
	}
	k--;
	if(m == 2) {
		if(n < 9) {
			for(int msk = 0; msk < 1<<n; msk++)
				limit = min(limit, longest(n, msk));
		}
		dfs(0, 0, n, k);
		cout << "-1\n";
		return 0;
	}
	const __int128 inf = ll(1e18) + 44;
	vector<__int128> suf_ways(n + 1);
	suf_ways[0] = 1;
	for(int i = 1; i <= n; i++) {
		if(i == n) suf_ways[i] = min(suf_ways[i - 1] * m, inf);
		else if(i + 1 == n) suf_ways[i] = min(suf_ways[i - 1] * (m - 1), inf);
		else suf_ways[i] = min(suf_ways[i - 1] * (m - 2), inf);
	}
	if(k > suf_ways.back()) {
		cout << "-1\n";
		return 0;
	}
	ll p2 = m + 1, p1 = m + 1;
	vector<int> ans;
	for(int i = 0; i < n; i++) {
		ll ord = k / suf_ways[n - 1 - i] + 1;
		ll val = ord;
		while(val == p1 || val == p2 || (val - (p1<val) - (p2<val)) < ord) val++;
		p2 = exchange(p1, val);
		ans.push_back(val);

		k %= suf_ways[n - 1 - i];
	}
	for(auto i : ans) cout << i << ' '; cout << '\n';
}