#include<bits/stdc++.h>
using namespace std;
const int mod=998244353;
const int mex=2005;
#define ll long long 
#define test int t;cin>>t;while(t--)
#define fast  ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fo(i,a,n) for(int i=a;i<n;i++)
#define rfo(i,a,b) for(int i=a;i>=b;i--)
#define bg begin()
#define en end()
#define fi first
#define se second
#define ub upper_bound
#define lb lower_bound
#define pb push_back
#define veci vector<int>
#define veclli vector<long long int> 
#define all(x) x.begin(),x.end()
#define sci(x) scanf("%d",&x);
#define scc(x) scanf("%c",&x);
#define scs(x) scanf("%s",x);
#define debug(arr,n) for(int i=0;i<n;i++) printf("%d ",arr[i]);
#define sz(x) x.size()
#define loop(x) for(auto it=x.begin();it!= x.end();it++) 

int main()
{
  int n,k,s;
  cin>>n>>k>>s;
  k=n-(k-1);
  if(k)
  {
  int fr[k]={0};
  fo(i,0,k-1)
  fr[i]=1;
  fr[k-1]=(s-(k-1));
  int arr[n+1];
  fo(i,0,n)
  {
      arr[i]=fr[i%k];
      cout<<arr[i]<<" ";
  }
  }
  else
  {
      if(s==1000000000)
      {
          fo(i,0,n)
          cout<<'1'<<" ";
      }
      else
      fo(i,0,n)
      cout<<s+1<<" ";
  }
  
}