#include <bits/stdc++.h>
#define rep(i,l,r) for(int i=l; i<=r; i++)
#define per(i,r,l) for(int i=r; i>=l; i--)
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
#define ilr int i,int l,int r
#define ls i<<1,l,mid
#define rs i<<1|1,mid+1,r
#define mi int mid=l+r>>1;
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
string res[13];
const int N=1e6+6;
int num[N<<2];
void bu(ilr){
    num[i]=r-l+1;
    if(l==r)return;
    mi
    bu(ls); bu(rs);
}
void ud(ilr,int x,int v){
    num[i]+=v;
    if(l==r)return;
    mi
    if(mid>=x)ud(ls,x,v);
    else ud(rs,x,v);
}
int qu(ilr,int k){
    if(l==r)return l;
    mi
    if(num[i<<1]<k)return qu(rs,k-num[i<<1]);
    return qu(ls,k);
}
int main() {
    IOS
    int n,m; ll k;
    cin>>n>>m>>k;
    if(m==1){
        if(k>1){
end:        cout<<-1; return 0;
        }
        rep(i,1,n)cout<<1<<' ';
        return 0;
    }
    if(m==2){
        int tot=0;
        if(0){
end1:   
            if(k>tot)goto end;     
            for(auto v:res[k])cout<<v<<' ';
            return 0;
        }
        if(n==2){
            tot=2; res[1]="12"; res[2]="21"; goto end1;
        }
        if(n==3){
            tot=6; res[1]="112"; res[2]="121"; res[3]="122";
            res[4]="211"; res[5]="212"; res[6]="221";
            goto end1;
        }
        if(n==4){
            tot=10; res[1]="1121"; res[2]="1122"; res[3]="1211"; res[4]="1212"; res[5]="1221";
            res[6]="2112"; res[7]="2121"; res[8]="2122"; res[9]="2211"; res[10]="2212";
            goto end1;
        }
        string s1="121122",s2="212211";
        rep(i,0,5){
            int x=i; ++tot;
            rep(j,1,n)res[tot]+=s1[x],x=(x+1)%6;
        }
        rep(i,0,5){
            int x=i; ++tot;
            rep(j,1,n)res[tot]+=s2[x],x=(x+1)%6;
        }
        sort(res+1,res+tot+1);
        goto end1;
    }
    __int128 all=1;
    rep(i,1,n){
        if(i==1)all*=m;
        else if(i==2)all*=m-1;
        else all*=m-2;
        if(all>=k)break;
    }
    if(all<k)goto end;
    vector<int> ans(n+1);
    auto cal=[&](int x,ll k){
        __int128 res=1;
        if(m==3){
            return (ll)((x==2)?2:1);
        }
        rep(i,x,n){
            if(i==2)res*=m-1;
            else res*=m-2;
            if(res>k)return k+1;
        }
        return (ll)res;
    };
    bu(1,1,m);
    rep(i,1,n){
        ll rea=cal(i+1,k);
        int v=(k-1)/rea+1; k-=(v-1)*rea;
        //!=前2个的第v大
        rep(j,1,2){
            if(i-j<=0)break;
            ud(1,1,m,ans[i-j],-1);
        }
        ans[i]=qu(1,1,m,v);
        // cout<<v<<' ';
        rep(j,1,2){
            if(i-j<=0)break;
            ud(1,1,m,ans[i-j],1);
        }
    }
    rep(i,1,n)cout<<ans[i]<<' ';
}