#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))
const int MOD = 1000000007;

int N,D,K;
bool memo[111][1111][11];
int a[100];

bool dfs(int n, int d, int k){
    if(k == 0){
        return (d == 0);
    }
    if(memo[n][d][k]) return false;
    
    for(int i = n; i <= min(d,N); i++){
        a[k-1] = i;
        if(dfs(i+1, d-i, k-1)) return true;
    }
    memo[n][d][k] = true;
    return false;
}

int main(){
    cin >> N >> D >> K;

    if(!dfs(1, D, K)){
        cout << -1 << endl;
    } else {
        for(int i = 0; i < K-1; i++){
            cout << a[K-i-1] << " ";
        }
        cout << a[0] << endl;
    }

    return 0;
}