#define _CRT_SECURE_NO_WARNINGS
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii;
typedef long long ll; typedef vector<long long> vl; typedef pair<long long,long long> pll; typedef vector<pair<long long,long long> > vpll;
typedef vector<string> vs; typedef long double ld;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int N;
char memo[101][1001][11];
vi ans;
char rec(int i, int d, int k) {
	char &r = memo[i][d][k];
	if(r != -1) return r;
	if(i == N) return r = d == 0 && k == 0;
	r = 0;
	r |= rec(i+1, d, k);
	if(d >= i+1 && k >= 1)
		r |= rec(i+1, d-(i+1), k-1);
	return r;
}
void solve(int i, int d, int k) {
	if(i == N) return;
	if(rec(i+1, d-(i+1), k-1)) {
		ans.pb(i+1);
		return solve(i+1, d-(i+1), k-1);
	}else {
		return solve(i+1, d, k);
	}
}

int main() {
	int D, K;
	scanf("%d%d%d", &N, &D, &K);
	mset(memo, -1);
	if(!rec(0, D, K)) {
		puts("-1");
	}else {
		solve(0, D, K);
		rep(i, ans.size()) {
			if(i != 0) putchar(' ');
			printf("%d", ans[i]);
		}
		puts("");
	}
	return 0;
}