#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> P;
typedef pair<P,int> PI;

const int MAX_N = 105;
const int MAX_D = 1005;
const int MAX_K = 12;

bool dp[MAX_N][MAX_K][MAX_D];
PI src[MAX_N][MAX_K][MAX_D];

int main()
{
	memset (dp, false, sizeof (dp ) );
	ios_base::sync_with_stdio(0);
	int N, D, K; cin >> N >> D >> K;
	dp[0][0][0] = true;
	src[0][0][0] = PI (P(-1, -1 ), -1 );
	rep (i, N ){
		for (int j = K; j >= 0; j-- ){
			for (int k = D; k >= 0; k-- ){
				if (dp[i][j][k] ){
					dp[i+1][j+1][k+i+1] |= dp[i][j][k];
					dp[i+1][j][k] |= dp[i][j][k];
					src[i+1][j+1][k+i+1] = PI (P (i, j ), k );
					src[i+1][j][k] = PI (P (i, j ), k );
				} // end if
			} // end for
		} // end rep
	} // end rep
//	cerr << (dp[N][K][D] ? "YES" : "NO" ) << endl; 

	vector<int> path; path.clear();
	if (dp[N][K][D] ){
		int n, k, d;
		n = N, k = K, d = D;
		while (n != -1 ){
			if (path.size() == 0 || path.back() != d ) path.push_back (d );
			PI curr = src[n][k][d];
			n = curr.first.first;
			k = curr.first.second;
			d = curr.second;
		} // end while
		rep (i, path.size()-1 ){
			cout << (path[path.size() - i - 2] - path[path.size() - i - 1] ) << (i != path.size() - 2 ? ' ' : '\n' );
		} // end rep
	}else{
		cout << -1 << endl;
	} // end if

	return 0;
}