#include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>

#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define pb push_back
using namespace std;

int big(int n, int c)
{
	int ret=0;
	rep(i,0,c) ret += n-i;
	return ret;
}

int small(int c)
{
	int ret=0;
	rep(i,1,c+1) ret += i;
	return ret;
}

int main(void)
{
	int N, D, K;
	cin >> N >> D >> K;

	int max = big(N,K);
	int min = small(K);
	printf("max=%d min=%d\n",max,min);
	if(D > max || min > D) {
		cout << -1 << endl;
		return 0;
	}

	vector<int> v;
	int mid = K;
	rep(i,1,K) {
		if(small(K-i) + big(N, i) + accumulate(v.begin(),v.end(),0) <= D) {
			rep(j,0,i) v.pb(N-j);
			mid = K-i;
		}
		unique(v.begin(), v.end());
	}

	rep(i,mid,N-mid) {
		if(small(mid-1) + accumulate(v.begin(),v.end(),0) + i == D) v.pb(i);
	}
	rep(i,1,mid) v.pb(i);
	sort(v.begin(),v.end());

	for(auto i: v) cout << i << " ";
	cout << endl;

	return 0;
}