#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
using ll = long long;

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

    vector<vector<vector<bool>>> dp(n + 1, vector<vector<bool>>(d + 1, vector<bool>(k + 1)));
    dp[n][d][k] = true;
    for (int i = n; i >= 0; i--) {
        for (int j = d; j >= 0; j--) {
            for (int l = k; l >= 0; l--) {
                if (i > 0 && dp[i][j][l]) {
                    dp[i - 1][j][l] = true;
                }
                if (i > 0 && j >= i && l > 0 && dp[i][j][l]) {
                    dp[i - 1][j - i][l - 1] = true;
                }
            }
        }
    }

    if (!dp[0][0][0]) {
        cout << -1 << endl;
        return 0;
    }

    bool first = true;
    int cost = 0, count = 0;
    for (int i = 0; i < n; i++) {
        if (dp[i + 1][cost + i + 1][count + 1]) {
            if (!first)cout << " ";
            first = false;
            cout << i + 1;
            cost += i + 1, count++;
        }
        if (cost == d)break;
    }
    cout << endl;
    return 0;
}