#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define REP(i, n) for (int (i) = 0; (i) < (n); (i)++) #define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++) #define RREP(i, a) for(int (i) = (a)-1; (i) >= 0; (i)--) #define FORR(i, a, b) for(int (i) = (a)-1; (i) >= (b); (i)--) #define PI acos(-1.0) #define DEBUG(C) cout<< C < #define VII vector #define VL vector #define VLL vector #define VD vector #define VDD vector #define PII pair #define PDD pair #define PLL pair #define VPII vector #define ALL(a) (a).begin(), (a).end() #define SORT(a) sort(ALL(a)) #define REVERSE(a) reverse(ALL(a)) #define MP make_pair #define FORE(a, b) for (auto &&a:b) #define FIND(s, e) (s.find(e) != s.end()) #define EB emplace_back using namespace std; typedef long long LL; typedef unsigned long long ULL; const int INF = 1e9; const int MOD = INF+7; const LL LLINF = 1e18; int N, D, K; bool check(int k, int now) { int sum = 0; REP(i, k) { sum += N - i; } return sum + now >= D; } int main(void) { cin >> N >> D >> K; int sum = 0; VI ans; FOR(i, 1, N + 1) { if (check(K - 1, sum + i)) { sum += i; ans.EB(i); if (--K == 0) break; } } if (K == 0 && accumulate(ALL(ans), 0) == D) { FORE(el, ans) { cout << el << " "; } cout << endl; } else { cout << -1 << endl; } }