#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e6 + 10;
const int BND = 1.1e18;
int n, m, k, a[N];
int pwm2[N];
inline int Mul(int x, int y) {
    __int128 tmp = x;
    tmp *= y;
    if (tmp > BND) tmp = BND;
    return tmp;
}
inline int Updiv(int x, int y) {
    return (x + y - 1) / y;
}
int tmpk;
int b[N];
int ans = 1e9;
vector<vector<int>> f;
inline void Dfs(int x) {
    if (x == n + 1) {
        int cnt = 0;
        for (int i = 1; i <= n; ++i) {
            for (int j = i; j <= n; ++j) {
                vector<int> c(b + i, b + j + 1);
                vector<int> d = c;
                reverse(d.begin(), d.end());
                if (c == d) ++cnt;
            }
        } 
        if (cnt < ans) { 
            ans = cnt;
            f.clear();
        }
        if (cnt == ans) {
            f.push_back(vector<int>(b + 1, b + n + 1));
        }
        return;
    }
    for (b[x] = 1; b[x] <= m; ++b[x]) Dfs(x + 1);
}
signed main() {
    scanf("%lld%lld%lld", &n, &m, &k);
    tmpk = k;
    if (n == 1) {
        printf("%lld\n", k <= m ? k : -1ll);
        return 0;
    }
    if (m == 1) {
        if (k == 1) {
            for (int i = 1; i <= n; ++i) printf("1 ");
            puts("");
        } else {
            puts("-1");
        }
        return 0;
    }
    if (m == 2) {
        if (n <= 6) {
            Dfs(1);
            if (k > f.size()) return puts("-1"), 0;
            for (auto x : f[k - 1]) cout << x << ' ';
            cout << endl;
        } else {
            int tmpn = n;
            n = 6;
            Dfs(1);
            if (k > f.size()) return puts("-1"), 0;
            for (int i = 0; i < tmpn; ++i) {
                printf("%lld ", f[k - 1][i % 6]);
            }
            puts("");
        }
        return 0;
    }
    pwm2[0] = 1;
    for (int i = 1; i <= n; ++i) pwm2[i] = Mul(pwm2[i - 1], m - 2);
    int all = Mul(pwm2[n - 2], m * (m - 1));
    if (all < k) return puts("-1"), 0;
    for (int i = 1; i <= n; ++i) {
        int oth = (i == 1 ? Mul(pwm2[n - i - 1], m - 1) : pwm2[n - i]);
        int cho = Updiv(k, oth);
        k -= oth * (cho - 1);
        int u = (i > 1 ? a[i - 1] : m + 1), v = (i > 2 ? a[i - 2] : m + 1);
        if (u > v) swap(u, v);
        if (cho >= u) ++cho;
        if (cho >= v) ++cho;
        a[i] = cho;
        assert(cho <= m);
    }
    assert(k == 1);
    for (int i = 1; i <= n; ++i) printf("%lld ", a[i]);
    puts("");

    // Dfs(1, m + 1, m + 1);
    // puts("-1");
    return 0;
}