#define _CRT_SECURE_NO_WARNINGS #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef vector vi; typedef vector vvi; typedef pair pii; #define all(c) (c).begin(), (c).end() #define loop(i,a,b) for(ll i=a; iDUMP &operator,(const T&t){if(this->tellp())*this<<", ";*this< src[111][111][1111]; int N,D,K; int main(){ while(cin>>N>>D>>K && N){ dump(N,D,K); memset(dp,0,sizeof(dp)); dp[0][0][0] = true; src[0][0][0] = mt(-1,-1,-1); for(int i=0;i=0;j--){ for(int k=D;k>=0;k--){ if(dp[i][j][k]){ dp[i+1][j+1][k+i+1] = true; src[i+1][j+1][k+i+1] = tie(i,j,k); } if(dp[i][j][k]){ dp[i+1][j][k] = true; src[i+1][j][k] = tie(i,j,k); } } } } if(dp[N][K][D]){ vi diff; int n,k,d; tie(n,k,d) = tie(N,K,D); while(n!=-1){ if(diff.size()==0 || diff.back()!=d) diff.push_back(d); tie(n,k,d) = src[n][k][d]; } int l = diff.size(); rep(i,l-1) cout << diff[l-i-2]-diff[l-i-1] << " "; cout << endl; }else{ puts("-1"); } } }