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

int N,D,K, a[11];

int main(){
    cin >> N >> D >> K;
    int t = 0;
    REP(i,K) a[i] = i+1, t += i+1;

    if(t > D){ cout << -1 << endl; return 0; }

    int l = N, f = D - t;
    for(int i = K-1; i >= 0; i--){
        int d = min(a[i] + f, l) - a[i];
        f -= d; a[i] += d; l--;
    }

    if(f){ cout << -1 << endl; return 0; }

    for(int i = 0; i < K; i++){
        if(i > 0) cout << " ";
        cout << a[i];
    }
    cout << endl;
}