#include <bits/stdc++.h> #define MOD 1000000007 #define pe(str) return cout<<(str)<<endl,0 #define px(str) cout<<(str)<<endl,exit(0) #define accu(ac,v) cout<<setprecision(ac)<<v<<endl #define pr(str) cout<<(str)<<endl #define prpr(str) cout<<str<<endl #define db(str) cerr<<"debug:"<<(str)<<endl #define dbdb(str) cerr<<"debugs:"<<str<<endl #define re(i,n) for(int i=0;i<(n);i++) #define rre(i,n) for(int i=(n);i>=0;i--) #define rep(i,a,b) for(int i=(a);i<(b);i++) #define rrep(i,a,b) for(int i=(b);i>=(a);i--) #define bw(a,b,c) (((a)<=(b))&&((b)<=(c))) #define spre(a) setprecision(a) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<int,int> pii; typedef complex<int> point; template<class InputIterator> void dump(InputIterator first,InputIterator last,char delim=' '){ for(InputIterator it=first;it!=last;it++){ if(it!=first)cout<<delim; cout<<*it; } } ull p(ull x,ull y){ if(y==0) return 1; ull A=p(x,y/2)%MOD; return (y&1?((A*A)%MOD*x)%MOD: (A*A)%MOD); // return (y&1?((A*A)*x):(A*A)); } template<class T> void swp(T &a,T &b){ T t=a; a=b; b=t; } // No65 int main(void){ int n,d,k; cin>>n>>d>>k; int a[k]; re(i,k)a[i]=i+1; int t=0; if(accumulate(a+n-k,a+n,0)<d)pe(-1); if((t=accumulate(a,a+k,0))>d)pe(-1); int i=0; TT: while(t<d){ a[k-i-1]++; t++; if(a[k-i-1]==n-i)i++; if(k-i-1<0)pe(-1); } dump(a,a+k); cout<<endl; return 0; }