#define _USE_MATH_DEFINES

#include <iostream>
#include <iomanip>

#include <algorithm>
#include <cmath>

#include <string>
#include <list>
#include <queue>
#include <vector>
#include <complex>
#include <set>

/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////

int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    //cout << setprecision(6);//

	int N,D,K;
	cin>>N>>D>>K;
	int v[10];
	int count;
	int sum=0;
	int temp;
	if( (1+K)*K/2 <= D && K <= N &&
		D <= (N-K+1+N)*K/2){
		rep(i,K){
			v[i] = i+1;
			sum += v[i];
		}
		count = 0;
		while(sum<D){
			temp = D-(sum-v[K-1-count]);
			if(temp <= N-count){
				sum = sum - v[K-1-count] + temp;
				v[K-1-count] = temp;
			}else{
				sum = sum -v[K-1-count] + N - count;
				v[K-1-count] = N - count;
			}
			++count;
		}
		rep(i,K){
			cout << v[i];
			if( i < K-1){
				cout << " ";
			}else{
				cout << endl;
			}
		}
	}else{
		P(-1);
	}
    return 0;
}