#include <bits/stdc++.h>
using namespace std;

#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
template <typename ...T>
void debug_(const char *s, T ...a) {
    cerr << "\e[1;32m( " << s << " ) = ( ";
    int cnt = sizeof...(T);
    (..., (cerr << a << (--cnt ? ", " : " )\e[0m\n")));
}
template <typename I>
void orange_(const char *s, I L, I R) {
    cerr << "\e[1;32m[ " << s << " ] = [ ";
    for (int f = 0; L != R; ++L)
        cerr << (f++ ? ", " : "") << *L;
    cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(a...) safe
#define orange(a...) safe
#endif

const int maxn = 1000025;
const int64_t INF = int64_t(1e18) + 25;

int64_t suf_prod[maxn];
int ans[maxn];
void f(int n, int i, int64_t k, vector<int> banned) {
    if (i == n) {
        return;
    }
    int64_t c = k / suf_prod[i + 1];
    int num = c;
    for (int x: set<int>(banned.begin(), banned.end()))
        if (x <= num) {
            ++num;
        }
    ans[i] = num;
    banned.push_back(num);
    if (banned.size() == 3) {
        banned = vector<int>(banned.begin() + 1, banned.end());
    }

    f(n, i + 1, k % suf_prod[i + 1], banned);
}

int64_t Mul(int64_t a, int64_t b) {
    if (a <= (INF + b - 1) / b) {
        return min(a * b, INF);
    } else {
        return INF;
    }
}

bool valid(vector<int> a) {
    auto b = a;
    reverse(b.begin(), b.end());
    return a == b;
}

vector<vector<int>> brute(int n) {
    const int n2 = 1 << n;
    vector<pair<int, vector<int>>> res;
    for (int i = 0; i < n2; ++i) {
        int an = 0;
        vector<int> a;
        for (int j = 0; j < n; ++j) {
            vector<int> b;
            for (int k = j; k < n; ++k) {
                b.push_back((i >> k) & 1);
                if (valid(b)) an++;
            }
            a.push_back((i >> j) & 1);
        }
        res.emplace_back(an, a);
    }
    vector<vector<int>> ret;
    sort(res.begin(), res.end());
    int v = res[0].first;
    for (auto [P, a] : res) {
        if (P != v) continue;
        ret.push_back(a);
    }
    return ret;
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n, m;
    int64_t k;
    cin >> n >> m >> k;

    if (m == 1) {
        if (k == 1) {
            for (int i = 0; i < n; i++)
                cout << 1 << (i+1==n ? '\n' : ' ');
        } else {
            cout << -1 << '\n';
        }
        return 0;
    }

    if (m == 2) {
        auto s = brute(min(n, 6));
        if (k > s.size()) {
            cout << -1 << '\n';
        } else {
            auto a = s[k - 1];
            for (int i = 0; i < n; i++) {
                cout << a[i % 6] + 1 << (i+1==n ? '\n' : ' ');
            }
        }
        return 0;
    }

    suf_prod[0] = m;
    suf_prod[1] = m - 1;
    for (int i = 2; i < n; i++) {
        suf_prod[i] = m - 2;
    }
    suf_prod[n] = 1;

    for (int i = n - 1; i >= 0; i--) {
        suf_prod[i] = Mul(suf_prod[i + 1], suf_prod[i]);
    }

    if (suf_prod[0] < k) {
        cout << -1 << '\n';
        return 0;
    }

    f(n, 0, k - 1, {});

    for (int i = 0; i < n; i++) {
        cout << ans[i] + 1 << (i+1==n ? '\n' : ' ');
    }

    return 0;
}