#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll mod=1000000007;
const int MAX_N = 1000;         // n の最大値
 
// nCk を取得
double nCk(int n, int k) {
double res=1.0;
for(int i=0; i<n; i++){
res*=0.5;}
for(int i=0; i<k; i++){
res*=(double)(n-i);
res/=(double)(k-i);
}
return res;}
 
int main() {
ll h,w,k;
cin>>h>>w>>k;
if(k==1000000000){
rep(i,w){
cout << 1000000000 << " ";}
rep(i, h-w){
cout << 1 << " ";}
cout << endl;}
else{
rep(i,w){
cout << k << " ";}
rep(i,h-w){
cout << k+1 << " ";}
cout << endl;}}