#include #include #include #include #include #include #include #include #include #define REP(i,k,n) for(int i=k;i P; int main() { int n,d,k; cin >> n >> d >> k; int sum = 0, t = n; rep(i,k) { sum += t; t--; } if(d < (k*(k+1))/2 || d > sum) cout << -1 << endl; else { vector v; rep(i,k) v.push_back(d/k); int cnt = d % k; rep(i,cnt) { v[i]++; } sort(v.begin(),v.end()); int s = 0, t = v.size()-1; vector down(n), up(n); rep(i,n) { down[i] = i+1; up[i] = n-k+1+i; } while(true) { if(s == t) break; if(v[s] == down[s] || v[s] == up[s]) { s++; continue; } if(v[t] == up[t]) { t--; continue; } int diff; if(v[s] >= up[s]) { diff = v[s] - up[s]; } else { diff = v[s] - down[s]; } while(diff) { if(v[t] + diff <= up[t]) { v[s] -= diff; v[t] += diff; diff = 0; } else { v[s] -= up[t] - v[t]; diff -= up[t] - v[t]; v[t] = up[t]; t--; } if(s == t) break; } } sort(v.begin(),v.end()); rep(i,v.size()) { cout << v[i]; if(i == v.size()-1) cout << endl; else cout << " "; } } return 0; }