#include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

//using lll=boost::multiprecision::cpp_int;
//using Double=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<1024>>;//仮数部が1024桁
template <class T>
inline bool chmin(T &a, T b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}

template <typename T>
T mypow(T x, T n, const T &p = -1)
{ //x^nをmodで割った余り

	if(p!=-1){
		x%=p;
	}
	T ret = 1;
	while (n > 0)
	{
		if (n & 1)
		{
			if (p != -1)
				ret = (ret * x) % p;
			else
				ret *= x;
		}
		if (p != -1)
			x = (x * x) % p;
		else
			x *= x;
		n >>= 1;
	}
	return ret;
}

using namespace std;
//using namespace atcoder;

bool dp[101][1001][11];
int pre[101][1001][11];
void solve()
{	
	int n,d,k;
	cin>>n>>d>>k;
	memset(dp,false,sizeof(dp));
	memset(pre,-1,sizeof(pre));
	dp[0][0][0]=true;
	rep(i,n){
		rep(j,k+1){
			rep(x,d+1){
				if(j+1<=k&&x+(i+1)<=d&&dp[i][j][x]){
					dp[i+1][j+1][x+(i+1)]=true;
					pre[i+1][j+1][x+(i+1)]=x;
				}
				dp[i+1][j][x]|=dp[i][j][x];
			}
		}
	}

	if(dp[n][k][d]){
		int pos=n;
		int used=k;
		int cur=d;
		vector<int>ans;
		while(pos>0){
			if(pre[pos][used][cur]==-1){
				--pos;
				continue;
			}
			int val=cur-pre[pos][used][cur];
			if(val&&val==pos){
				ans.eb(val);

				cur=pre[pos][used][cur];
				used--;
			}
			--pos;
		}
		reverse(all(ans));
		rep(i,ans.size()){
			cout<<ans[i]<<(i==ans.size()-1?"\n":" ");
		}
	}else{
		cout<<-1<<"\n";
	}
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}