#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#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> 
#define ld long double
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define all(a) a.begin(),a.end()
#define sz(a) (ll)(a.size())
int main()
{
	int n,k,s;
	cin>>n>>k>>s;
	cout<<s<<" ";
	for(int i=1;i<k;i++)
		cout<<"0 ";
	int z = 1e9;
	for(int i=1;i<=n-k;i++)
	{
		if(s!=z)
			cout<<z<<" ";
		else
			cout<<z-1<<" ";
	}
	cout<<"\n";
	return 0;
}