#include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <random>
#include <bits/stdc++.h>

using namespace std;
#define F first
#define S second
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, a, b) for(int i = b-1; i>=a ; i--)
#define trav(a, x) for(auto& a : x)
#define allin(a , x) for(auto a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef pair<ll,ll> pll;
typedef vector<string> vs;
typedef vector<pll> vpl;
typedef vector<int> vi;

ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down

#define Unique(v) sort(all(v));v.erase(unique(all(v)),v.end());

const int maxn = 10*100000 + 10;

// const int inf = 1000000000;
// const ll inf = 1000000000000000000LL;

// const ll mod = 998244353;
// const ll mod = 1000000007; // 10^9 + 7

ll n, m, k;

ll pw[maxn];

void printAnswer(vector<ll> v = {})
{
    if( v.empty() )
        cout << -1 << endl;
    else
    {
        for(ll x: v)
            cout << x << " ";

        cout << endl;
    }

    exit(0);
}

void dealSmallCases()
{
    if( n == 1 )
    {
        if( k <= m )
            printAnswer( { k } );
        else
            printAnswer();
    }

    if( m == 1 )
    {
        if( k == 1 )
            printAnswer( vector<ll>(1, n) );
        else
            printAnswer();
    }
}

ll lim;

ll mult(ll a, ll b)
{
    if( a >= lim || b >= lim || a > lim/b )
        return lim;

    return min( a*b , lim );
}

void generalCase()
{
    pw[0] = 1;

    for(int i = 1 ; i <= n ; i++)
        pw[i] = mult( pw[i - 1] , m - 2 );

    ll numWays = mult( m , m - 1 );
    numWays = mult( numWays , pw[n - 2] );

    if( numWays < k )
        printAnswer();

    vector<ll> ans(n);

    for(int i = 0 ; i < n ; i++)
    {
        ll numWaysRemain = pw[n - i - 1];
        if( i == 0 ) numWaysRemain = mult( m - 1 , pw[n - 2] );

        ans[i] = (k - 1)/numWaysRemain;
        k -= ans[i]*numWaysRemain;

        ans[i]++;

        ll a = (i >= 1) ? ans[i - 1] : m + 1;
        ll b = (i >= 2) ? ans[i - 2] : m + 1;

        if( ans[i] >= min( a , b ) )
            ans[i]++;

        if( ans[i] >= max( a , b ) )
            ans[i]++;
    }

    printAnswer(ans);
}

bool isPalindrome(vector<ll> v)
{
    vector<ll> a = v;
    reverse( a.begin() , a.end() );

    return (v == a);
}

int numPalindromes(vector<ll> v)
{
    int ans = 0;
    int n = (int)v.size();

    for(int i = 0 ; i < n ; i++)
    {
        vector<ll> cur = { v[i] };

        for(int j = i + 1 ; j < n ; j++)
        {
            cur.push_back( v[j] );

            if( isPalindrome(cur) )
                ans++;
        }
    }

    return ans;
}

void binaryArray()
{
    if( n < 6 )
    {
        int minValue = 738242;
        vector< vector<ll> > answers;

        for(int mask = 0 ; mask < (1 << n) ; mask++)
        {
            vector<ll> cur(n);

            for(int j = 0 ; j < n ; j++)
                cur[j] = (mask >> j)%2;

            minValue = min( minValue , numPalindromes(cur) );
        }

        for(int mask = 0 ; mask < (1 << n) ; mask++)
        {
            vector<ll> cur(n);

            for(int j = 0 ; j < n ; j++)
                cur[j] = (mask >> j)%2;

            for(int j = 0 ; j < n ; j++)
                cur[j]++;

            if( numPalindromes(cur) == minValue )
                answers.push_back( cur );
        }

        sort( answers.begin() , answers.end() );

        if( k <= (int)answers.size() )
            printAnswer( answers[k - 1] );
        else
            printAnswer();
    }

    vector< vector<ll> > starts = {
        {1, 1, 0, 1, 0, 0},
        {1, 0, 1, 1, 0, 0},
        {1, 1, 0, 0, 1, 0},
        {0, 1, 1, 0, 1, 0},
        {1, 0, 0, 1, 1, 0},
        {0, 1, 0, 1, 1, 0},
        {1, 0, 1, 0, 0, 1},
        {0, 1, 1, 0, 0, 1},
        {1, 0, 0, 1, 0, 1},
        {0, 0, 1, 1, 0, 1},
        {0, 1, 0, 0, 1, 1},
        {0, 0, 1, 0, 1, 1},
    };

    sort( starts.begin() , starts.end() );

    if( k <= 12 )
    {
        vector<ll> ans = starts[k - 1];

        for(int i = 6 ; i < n ; i++)
            ans.push_back( ans[i%6] );

        for(int i = 0 ; i < n ; i++)
            ans[i]++;

        printAnswer(ans);
    }
    else
        printAnswer();
}

void solve(int testcase)
{
    cin >> n >> m >> k;
    lim = k + 1;

    dealSmallCases();

    if( m >= 3 )
        generalCase();
    else
        binaryArray();
}

int main()
{
    ios_base::sync_with_stdio(false);  
    cin.tie(NULL);

    int t = 1;
    // cin >> t;

    for(int testcase = 1 ; testcase <= t ; testcase++)
        solve( testcase );
}