#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>

#define INF 1000000000

using namespace std;
typedef long long ll;

int N, D, K;
vector<vector<int> > ans;
bool isVisit[110][1010][12];

void dfs(int n, int d, int k, vector<int>& s) {
    if (isVisit[n][d][k]) return;
    isVisit[n][d][k] = true;
    if (k == 0) {
        if (d == 0) ans.push_back(s);
        return;
    }
    for (int i = n; i <= min(d, N); i++) {
        s.push_back(i);
        dfs(i+1, d-i, k-1, s);
        s.pop_back();
    }
}

int main(void) {
    cin >> N >> D >> K;
    vector<int> tmp;
    dfs(1, D, K, tmp);
    if (ans.empty()) cout << -1 << endl;
    else {
        for (int i = 0; i < ans[0].size(); i++) {
            cout << ans[0][i];
            if (i != ans[0].size()-1) cout << " ";
        }
        cout << endl;
    }
    return 0;
}