#include <iostream>
#include <cstdio>
#include <string>
#include <sstream>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#define PI 3.14159265359
#define INF 99999999;
#define rep(i, n) for(int i=0; i<n; i++)
#define REP(n) rep(i, n)
#define EPS 1e-10
typedef long long ll;
using namespace std;



/*
class Target
{
public:
	vector <string> draw(int n)
	{

	}
};
*/

int N, D, K;
bool memo[110][1010][12];
int ans[14];


bool dp_go(int now,int d,int k){
  if (now == N+1) {
    return (d == 0 && k == K);
  }
  if (memo[now][d][k]) {
    return false;
  }
  memo[now][d][k] = true;
  if (k+1 <= K && d - now >= 0){
    if (dp_go(now+1, d- now, k+1)){
      ans[k] = now;
      return true;
    }
  }
  if (dp_go(now+1, d , k)){
    return true;
  }
  return false;
}

int main()
{
	cin >> N >> D >> K;
	
	if (!dp_go(1, D, 0))
	{
		cout << -1 << endl;
		return 0;
	}
	
	rep(i, K)
	{
		cout << ans[i] << " ";
	}
	cout << endl;
	
	return 0;
}