#include <bits/stdc++.h>
using namespace std;

int main() {
    int n, d, k;
    cin >> n >> d >> k;
    int sum = 0;
    vector<int> ans;
    for (int i = 1; i <= n; i++) {
        if (ans.size() == k - 1) {
            ans.push_back(d - sum);
            break;
        } else {
            ans.push_back(i);
            sum += i;
        }
    }
    sort(ans.begin(), ans.end());
    bool ok = true;
    for (int i = 0; i+1 < ans.size(); i++) {
        ok &= (ans[i] != ans[i+1]);
    }
    if (ok) {
        for (const auto &e : ans) cout << e << '\n';
    } else {
        cout << -1 << endl;
    }
    return 0;
}