#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string.h>
#include <queue>
#include <map>//<string,int>
#include <math.h>
#include <set>
#include <vector>
#include <stack>
#include<sstream>
#define ll long long
#define mod 20010905
const int INF = 0x3f3f3f3f;
const int NINF = -INF - 1;
const int N=2e5+5;
const int maxn=200100;
using namespace std;
map<double,int > mp;

ll n,k,s;
ll a[maxn]; 

int main()
{
	//freopen("E:\\programme\\C++\\test.txt","r",stdin);
    cin>>n>>k>>s;
    int l=s/2;
    for(int i=1; i<=k+1 ;i++)
      {
      	if(i%2) a[i]=l;
      	else    a[i]=s-l;
	  }
	int h=100256;
	for(int j=k+2; j<=n; j++,h++)
	  a[j]=h;
	for(int i=1; i<=n; i++)
	 cout<<a[i]<<" ";
	return 0;
 }
