//#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <cmath>
#include <vector>
#include <cstring>
#define INF 114514
using namespace std;

typedef pair<double,double> P;
typedef long long ll;

int N,K,D;
vector<int> vi;
bool used[102][1001][11];

void dfs(int d,int n,int k){
	if(k > K || d > D || n-1 > N)return;
	if(used[n][d][k])return;
	used[n][d][k] = true;
	if(k == K && d == D){
		for(int i=0;i<vi.size();i++){
			cout << vi[i];
			if(i == vi.size()-1)cout << endl;
			else cout << " ";
		}
		exit(0);
	}
	vi.push_back(n);
	dfs(d+n,n+1,k+1);
	vi.pop_back();
	dfs(d,n+1,k);
}

int main(void) {
	cin >> N >> D >> K;
	dfs(0,1,0);
	cout << -1 << endl;

}

//command ctrl 上下
//command D
//command caps G → '' ""