#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const vector<int> INF = {(int)1e9 + 7};
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

int main() {
    int n, d, k; cin >> n >> d >> k;
    vector<vector<vector<int>>> dp(d + 1, vector<vector<int>>(k + 1, INF));
    dp[0][0] = {};
    for (int a = 1; a <= n; a++) {
        for (int i = d; i >= 0; i--) if (i + a <= d) {
            for (int j = 0; j < k; j++) {
                auto nxt = dp[i][j];
                nxt.emplace_back(a);
                chmin(dp[i + a][j + 1], nxt);
            }
        }
    }
    if (dp[d][k] == INF) {
        cout << -1 << endl;
    } else {
        for (int i = 0; i < k; i++) cout << dp[d][k][i] << " \n"[i == k - 1];
    }
    return 0;
}