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

#define RREP(i,s,e) for (i = e-1; i >= s; i--)
#define rrep(i,n) RREP(i,0,n)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 1e8

typedef long long ll;

int main() {
    int i, n, d, k;
    cin >> n >> d >> k;
    int val[k+1];
    rep (i,k+1) {
        val[i] = i;
        d -= i;
    }
    for (i = k; i > 0 && d > 0; i--) {
        int add = min(d,n-(k-i)-val[i]);
        val[i] += add;
        d -= add;
    }
    if (d == 0) {
        for (i = 1; i <= k; i++)
            cout << val[i] << " ";
        cout << endl;
    }
    else
        cout << -1 << endl;
    return 0;
}