#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
const int MAXN=200010;
int n,k,m;
int x,y,l,last;
int sol[MAXN];
int main(){
cin>>n>>k>>m;
x=m/k;
l=m%k;
y=x%(2*(n-1));
x=x/(2*(n-1));
for(int i=0;i<n;i++){
sol[i]+=x*k;
}
for(int i=0;i<min(n,y);i++){
sol[i]+=k;
last=i;
}
y-=min(n,y);
if(!y){
last++;
if(last==n) last-=2;
sol[last]+=l;
}
else{
for(int i=0;i<y;i++){
sol[n-i-1]+=x*k;
last=n-i-1;
}
last--;
if(last==-1) last+=2;
sol[last]+=l;
}
for(int i=0;i<n;i++){
cout<<sol[i]<<" ";
}
cout<<"\n";
return 0;
}
