#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (int i = (int)(s - 1); i >= (int)(e); i--)
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

template <typename T, typename U>
T chmax(T& a, const U& b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T, typename U>
T chmin(T& a, const U& b) {
    if (a <= b) return false;
    a = b;
    return true;
}

void yes_no(bool f, string yes = "Yes", string no = "No") { cout << (f ? yes : no) << "\n"; }

void solve() {
    int n, d, k;
    cin >> n >> d >> k;
    vector memo(d + 1, vector(k + 1, vector(n + 1, 0)));
    vector used(d + 1, vector(k + 1, vector(n + 1, 0)));
    vi ans;
    auto dfs = [&](auto self, int i, int j, int s) -> int {
        if (used[i][j][s]) return memo[i][j][s];
        used[i][j][s] = 1;
        if (i == 0 && j == 0) return memo[i][j][s] = 1;
        if (i == 0 || j == 0) return memo[i][j][s] = 0;
        for (int x = s; x <= i && x <= n; ++x) {
            if (self(self, i - x, j - 1, x + 1)) {
                ans.emplace_back(x);
                return memo[i][j][s] = 1;
            }
        }
        return memo[i][j][s] = 0;
    };
    if (dfs(dfs, d, k, 1)) {
        reverse(all(ans));
        rep(i, ans.size()) cout << ans[i] << (i + 1 == (int)ans.size() ? '\n' : ' ');
    } else {
        cout << -1 << '\n';
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    // multi-testcase
    // cin >> t;
    rep(ti, t) solve();
    return 0;
}