#include <iostream>
#include <vector>
using namespace std;

int N, D, K;
vector<int> dp[1010][20];

int main() {
	cin >> N >> D >> K;
	dp[0][0].push_back(0);
	for (int i = 1; i < N + 1; ++i) {
		for (int j = D; j >= 0; --j) {
			for (int k = 0; k < K; ++k) {
				if (dp[j][k].size() == 0) continue;
				dp[i + j][k + 1] = dp[j][k];
				dp[i + j][k + 1].push_back(i);
			}
		}
	}
	if (dp[D][K].size() == 0) cout << -1;
	else {
		for (int i = 1; i < dp[D][K].size(); ++i) cout << dp[D][K][i] << " \n"[i == dp[D][K].size() - 1];
	}
	return 0;
}