#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair pii; typedef pair pll; const int INF = 1e9; const ll LINF = 1e18; template ostream& operator << (ostream& out,const pair& o){ out << "(" << o.first << "," << o.second << ")"; return out; } template ostream& operator << (ostream& out,const vector V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; } template ostream& operator << (ostream& out,const vector > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; } template ostream& operator << (ostream& out,const map mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; } /* 問題文============================================================ ================================================================= 解説============================================================= ================================================================ */ vector solve(){ vector res; ll N,D,K; cin >> N >> D >> K; vector>> dp(D+1,vector>(K+1,vector{INF})); dp[0][0] = {}; for(int i = 1; i <= N;i++){ for(int j = D-1; j >= 0;j--){ if(i+j>D) continue; for(int k = 0; k < K;k++){ vector it = dp[j][k]; it.push_back(i); dp[i+j][k+1] = min(dp[i+j][k+1],it); } } } if(dp[D][K][0] == INF){ return vector{-1}; }else{ return dp[D][K]; } return res; } int main(void) { cin.tie(0); ios_base::sync_with_stdio(false); cout << solve() << endl; return 0; }