#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;


int main() {
    
    int N,D,K;
    cin >> N >> D >> K;
    
    if ( N < K ) { cout << -1 << endl; return 0; }

    vector<int> V(K);
    int sum = 0;

    for ( int i = 0; i < K; i++ ) {
        V[i] = i+1;
        sum += V[i];
    }

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

    int pre = INT_MAX;
    for ( int i = K-1; i >= 0; i-- ) {
        if ( sum == D ) { break; }

        while ( V[i] < N && V[i] < pre-1 ) {
            V[i]++;
            sum++;
            if ( sum == D ) { break; }
        }
        pre = V[i];
    }

    if ( sum != D ) { cout << -1 << endl; }
    else {
        for ( int i = 0; i < K; i++ ) {
            cout << V[i];
            if ( i != K-1 ) { cout << " "; }
        }
        cout << endl;
    }


    return 0;
}