#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <cstdio>
#include <numeric>

using namespace std;

using ll=long long;

vector<ll> v;
ll N,K,S;

int main()
{
    cin >> N >> K >> S;
    v.resize(N);
    fill(v.begin(), v.end(), 1);
    if(K == 0)
    {
        if( S+1 <= 1e9)
        {
            fill(v.begin(), v.end(),S+1);
        }
        else
        {
            fill(v.begin(), v.end(),1);
        }
    }
    else if(K == N)
    {
        fill(v.begin(), v.end(),S);
    }
    else if(N == 1)
    {
        v[0] = S;
    }
    else
    {
        if(S == 1)
        {
            fill(v.begin()+K, v.end(), 2);
        }
        else
        {
            ll cnt = 0;
            ll d;
            if(S == 3)
            {
                d = 10
            }
            else
            {
                d = 2;
            }
            fill(v.begin(), v.end(), d);
            v[0] = S-d;
            for(int i = 1; i < N;i++)
            {
                if(i % 2 == 1)
                {
                    v[i] = d;
                }
                else
                {
                    v[i] = S-d;
                }
                cnt++;
                if(cnt >= K)
                {
                    break;
                }
            }
        }
    }
    for(int i = 0;i < N - 1;i++)
    {
        cout << v[i] << " ";
    }
    cout << v[N-1] << endl;
    return 0;
}