#include <bits/stdc++.h>
#define int ll
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3yqVz8E ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e
signed main(){
_3yqVz8E;
int n,k,m;
cin>>n>>k>>m;
int x=(m-2+n)/((2*n-2)*k);
x=max(x,0ll);
vi a(n,0);
int i=-1,dir=1;
if(x>0){
i=n-1,dir=-1;
a[0]=a[n-1]=k*x;
rng(i,1,n-1)a[i]=k*(2*x-1);
m-=(2*x*k+(n-2)*(k*(2*x-1)));
}
while(m){
i+=dir;
a[i]+=min(m,k);
m-=min(m,k);
if(i==n-1 and dir==1)dir=-1;
if(i==0 and dir==-1)dir=1;
}
rep(i,n){
cout<<a[i]<<" ";
}
}
