#include "bits/stdc++.h"
#define REP(i,n,N) for(int i=(n); i<(N); i++)
#define RREP(i,n,N) for(int i=(N-1); i>=n; i--)
#define CK(n,a,b) (a)<=(n)&&(n)<(b)
#define ALL(v) (v).begin(),(v).end()
#define p(s) cout<<(s)<<endl
typedef long long ll;
using namespace std;
const ll mod =1e9+7;


int N,D,K;
vector<int> dp[1010][11];

int main(){
    cin>>N>>D>>K;
    dp[0][0].push_back(0);
    REP(i,1,N+1){
        RREP(j,0,D+1){
            RREP(k,0,K+1){
                if(j+i>D||k==K||dp[j][k].size()==0) continue;
                if(dp[j+i][k+1].size()<=dp[j][k].size()+1){
                    dp[j+i][k+1] = dp[j][k];
                    dp[j+i][k+1].push_back(i);
                }
            }
        }
    }
    if(dp[D][K].size()<=K) p(-1);
    else{
        REP(i,1,K+1){
            cout<<dp[D][K][i]<<" ";
        }
        cout<<endl;
    }
    return 0;
}