#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;
#define int ll


int n,m,k;

vector<int> cur;
int best=1e18;
vector<vector<int>> ans;

bool check(int l,int r)
{
    for(int i=l,j=r;i<j;i++,j--)
        if(cur[i]!=cur[j])
            return false;
    return true;
}

int calc()
{
    int res=0;
    for(int l=0;l<n;l++)
        for(int r=l;r<n;r++)
            res+=check(l,r);
    return res;
}

void brute()
{
    if(cur.size()==n){
        int cnt=calc();
        if(cnt<best)
            best=cnt,
                    ans={cur};
        else if(cnt==best)
            ans.push_back(cur);
        return;
    }
    cur.push_back(-1);
    for(int i=1;i<=m;i++)
    {
        cur.back()=i;
        brute();
    }
    cur.pop_back();
}

signed 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;
    // }
    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) {
        int my_n=n;
        n=min<int>(n,12);
        brute();
        if(k>=ans.size())
            cout<<-1;
        else
        {
            for(int i=0;i<my_n;i++)
                cout<<ans[k][i%ans[k].size()]<<" ";
        }
        return 0;
    }
#undef int
    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';
}