#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>

#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> P;

int main() {
    int n,d,k;
    cin >> n >> d >> k;

    int sum = 0, t = n;
    rep(i,k) {
        sum += t;
        t--;
    }

    if(d < (k*(k+1))/2 || d > sum) cout << -1 << endl;
    else {
        vector<int> v;
        rep(i,k) v.push_back(d/k);

        int cnt = d % k;
        rep(i,cnt) {
            v[i]++;
        }

        sort(v.begin(),v.end());
        int s = 0, t = v.size()-1;

        vector<int> down(n), up(n);
        rep(i,n) {
            down[i] = i+1;
            up[i] = n-k+1+i;
        }

        while(true) {

            if(v[s] == down[s]) {
                s++;
                continue;
            }

            if(v[t] == up[t]) {
                t--;
                continue;
            }

            if(s == t) break;

            int diff = v[s] - down[s];
            while(diff) {
                if(v[t] + diff <= up[t]) {
                    v[s] -= diff;
                    v[t] += diff;
                    diff = 0;
                }
                else {
                    v[s] -= up[t] - v[t];
                    diff -= up[t] - v[t];
                    v[t] = up[t];
                    t--;
                }
            }

        }

        rep(i,v.size()) {
            cout << v[i];

            if(i == v.size()-1) cout << endl;
            else cout << " ";
        }
    }


    return 0;
}