#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <random>
#include <cassert>
#include <cstring>
using namespace std;

#define GET_ARG(a,b,c,F,...) F
#define REP3(i,s,e) for (i = s; i <= e; i++)
#define REP2(i,n) REP3 (i,0,(int)(n)-1)
#define REP(...) GET_ARG (__VA_ARGS__,REP3,REP2) (__VA_ARGS__)
#define RREP3(i,s,e) for (i = s; i >= e; i--)
#define RREP2(i,n) RREP3 (i,(int)(n)-1,0)
#define RREP(...) GET_ARG (__VA_ARGS__,RREP3,RREP2) (__VA_ARGS__)
#define DEBUG(x) cerr << #x ": " << x << endl

int main(void) {
    int i, n, d, k;
    cin >> n >> d >> k;
    if (n < k || k * (2 * n - k + 1) / 2 < d || k * (k + 1) / 2 > d) {
        puts("-1");
        return 0;
    }
    vector<int> ans(k);
    for (i = k-1; i > 0; i--,n--){
        ans[i] = min(n,d - i * (i + 1) / 2);
        d -= ans[i];
    }
    ans[0] = d;
    REP (i,k) cout << ans[i] << " \n"[i==k-1];
    return 0;
}