#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 1000000007
#define inf 1000000000000000
#define autoit(x,it) for(auto it = x.begin(); it != x.end(); it++)
#define rep(n) for(ll i = 0; i < n; i++)
#define repi(i,n) for(ll i = 0; i < n; i++)

#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds; 

#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update> 

using namespace std;


int main()
{
   FAST/**/
   
   ll n,k,s;
   cin>>n>>k>>s;
   
   if(2*s>=1000000000)
   {
       ll temp = s/n - 5;
       for(ll i=0;i<k;i++)
        cout<<s<<" ";
   for(ll i=k;i<n;i++)
        cout<<temp<<" ";
   }
   
   for(ll i=0;i<k;i++)
        cout<<s<<" ";
   for(ll i=k;i<n;i++)
        cout<<2*s<<" ";
   
   return 0;        
}  
   