#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a, I = b; i <= I; ++i)
#define per(i, a, b) for (int i = a, I = b; i >= I; --i)
using i64 = long long;
using i128 = __int128_t;
using pii = pair<i64, i64>;
template<typename T> void up(T &x, T y) { if (x < y) x = y; }
template<typename T> void down(T &x, T y) { if (x > y) x = y; }

const int N = 1000005;
int n, m, a[N], cnt;
i64 k, ways[N];

bool check(int rp) {
    if (rp == 2 && n > 2) return true;
    int cnt = 0;
    rep(lp, max(1, rp - 6), rp - 1) {
        bool flag = true;
        rep(i, lp, (lp + rp) / 2) flag &= (a[i] == a[lp + rp - i]);
        cnt += flag;
        if (cnt > (rp > 2)) return false; 
    }
    return true;
}
void dfs(int cur) {
    if (cur == n + 1) {
        if (++cnt == k) {
            rep(i, 1, n) cout << a[i] << " \n"[i == n];
            exit(0);
        }
        return;
    }
    rep(i, 1, 2) {
        a[cur] = i;
        if (check(cur)) dfs(cur + 1);
    }
}

i64 mul(i64 x, i64 y) {
    return min(i128(2e18), i128(x) * y);
}
int get_rank(int i, int x) {
    if (x == a[i - 1] || (i > 1 && x == a[i - 2])) return -1;
    int res = x;
    if (i > 1) res -= (x > a[i - 1]);
    if (i > 2) res -= (x > a[i - 2]);
    return res;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);

    cin >> n >> m >> k;
    
    if (m == 1) {
        if (k > 1) {
            cout << "-1\n";
            return 0;
        }
        rep(i, 1, n) cout << 1 << " \n"[i == n];
        return 0;
    }
    if (m == 2) {
        dfs(1);
        cout << "-1\n";
        return 0;
    }

    ways[0] = 1;
    rep(i, 1, n - 2) ways[i] = mul(ways[i - 1], m - 2);
    if (n > 1) ways[n - 1] = mul(ways[n - 2], m - 1);
    ways[n] = mul(ways[n - 1], m);

    if (k > ways[n]) {
        cout << "-1\n";
        return 0;
    }
    rep(i, 1, n) {
        int need = (k + ways[n - i] - 1) / ways[n - i];
        a[i] = need;
        while (get_rank(i, a[i]) < need) ++a[i];
        k -= (need - 1) * ways[n - i];
        cout << a[i] << " \n"[i == n];
    }
    
    return 0;
}