#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>   
#include<limits.h>
#include<list>
#include <array>
using namespace std;
#define i64  long long
#define int  long long
 
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807
#define INF I64_MAX
#define MOD 1000000007
#define MEM_SIZE = 1e5+5;

template<typename T> void DEBUG(T e){std::cout <<"DEBUG>>"<< e << std::endl;}
template<typename T> void DEBUG(const std::vector<T>& v){for(const auto& e : v){ std::cout << e << " "; } std::cout << std::endl;}
template<typename T> void DEBUG(const std::vector<std::vector<T> >& vv){ for(const auto& v : vv){ DEBUG(v); } }

//-----CODE------//

void solve(void)
{
  int N,K,S;
  cin>>N>>K>>S;

  vector<int> ANS(N,0);
  if(K == N)
  {
    for (int i = 0; i < N; i++)
    {
      if(i!=0)cout<<" ";
      cout<<S;
    }
    cout<<endl;
    return;
  }

  for (int i = 0; i < N; i++)
  {

    if(i <= K)
    {
    ANS[i] =  S/2;
    if(S%2 == 1)
    {
      if(i%2 == 1)
      {
        
        ANS[i]++;
      }
    }
      if((K == 0)&&(S == 1e9))
      {
        ANS[i] = 999999999;
      }
    }
    else
    {
      if(S != 1e9)
      {
        ANS[i] = 1;
      }
      ANS[i] = 1e9;
      else
      {
        ANS[i] = 999999999;
      }
      
    }
  }
  for (int i = 0; i < N; i++)
  {
    if(i!= 0)cout<<" ";
    cout<<ANS[i];
  }
  cout<<endl;
  
  
  
  return;
}


int32_t main(int32_t argc, const char *argv[])
{
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);

  // std::cout << std::fixed;
  // std::cout << std::setprecision(8);
  solve();

 
  return 0;
}