peterverebics/CodeNet_Python_118 huggingface dataset:
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

N, K, S = lr()
INF = 10 ** 9
if S < INF:
    answer = [S] * K + [S+1] * (N-K)
else:
    answer = [S] * K + [1] * (N-K)    

print(*answer)
n,k,s = map(int,input().split())
if s%2 == 0:
    for i in range(k):
        print(s,end=" ")
    for i in range(n-k):
        if n-k-1 == i:
            print(11021021)
            break
        print(11021021,end=" ")
else:
    for i in range(k):
        print(s,end=" ")
    for i in range(n-k):
        if n-k-1 == i:
            print(11021021)
            break
        print(11021021,end=" ")
n, k, s = map(int, input().split())

if s == 10 ** 9:
    ans = [s] * k + [1] * (n - k)
else:
    ans = [s] * k + [s + 1] * (n - k)

print(*ans)
N, K, S = map(int, input().split())
if S > 2:
    print(*([S]*K+[S-1]*(N-K)))
else:
    print(*([S]*K+[S+10**6]*(N-K)))
import sys
input = sys.stdin.readline

n, k, s = [int(x) for x in input().split()]

ans = [s]*k
add = s + 1 if s + 1 <= 10**9 else s - 1
for i in range(n - len(ans)):
    ans.append(add)
print(*ans)
import math


n,k,s = map(int,input().split())

for i in range(k):
    print(s,end=" ")





blank = pow(10,9)-1
if s == blank:
    blank = 1

for i in range(k,n):
    text = " "
    if  i == n-1:
        text = ""
    print(blank,end=text)
print()
N, K, S = map(int, input().split())

res = []
for x in range(K):
    res.append(S)

q = N - K

fix = round(1e9) if S != 1e9 else round(1e9 - 1)

for _q in range(q):
    res.append(fix)

print(' '.join(map(str, res)))
n,k,s = map(int, input().split())
if s!=10**9:
    x = [10**9]*n
else:
    x = [1]*n

for i in range(k):
    x[i]=s
print(*x)
n, k, s = map(int, input().split())
if s == 10 ** 9:
    l = [s] * k + [1] * (n - k)
else:
    l = [s] * k + [s + 1] * (n - k)
print(*l)
n, k, s = map(int, input().split())
if s != 10**9:
  for i in range(n):
    if i < k:
      print(s)
    else:
      print(10**9)
else:
  for i in range(n):
    if i < k:
      print(10**9)
    else:
      print(1)
N,K,S = map(int,input().split())
A = [10**9]*N
if S != 10**9:
    for i in range(K):
        A[i] = S
else:
    for i in range(N-K):
        A[i] = 10**9-1
print(*A)
N,K,S=map(int,input().split())
A=[]


for i in range(K):
  print(S,end=" ")
  
for j in range(N-K):
  if S!=10**9:
    print(10**9,end=" ")
  else:
    print(1,end=" ")
N,K,S = map(int, input().split())

if S == 10**9:
  ans = [S]*K +[1]*(N-K)
else:
  ans = [S]*K +[S+1]*(N-K)

ans_txt=''

for s in ans:
  ans_txt += str(s)+' '

print(ans_txt)
n, k, s = map(int, input().split())

ans = [s for _ in range(k)]
if s == 10**9:
  ans += [1 for _ in range(n - k)]
else:
  ans += [s+1 for _ in range(n - k)]

print(*ans)
N, K, S = map(int, input().split())

M = 1000000000
_S = M - 1 if S == M else M
print(' '.join(list(map(str, [S] * K + [_S] * (N - K)))))
import sys


def LI():
    return list(map(int, input().split()))


N, K, S = LI()
if K == 0:
    if S == 10**9:
        for i in range(N):
            print(1, end=" ")
    else:
        for i in range(N):
            print(10**9, end=" ")
    sys.exit()
for i in range(K):
    print(S, end=" ")
if S == 10**9:
    for i in range(N-K):
        print(S-1, end=" ")
else:
    for i in range(N-K):
        print(S+1, end=" ")
n, k, s = map(int, input().split())
if k == n:
    print(" ".join([str(s) for _ in range(n)]))
    exit()

arr = []
for i in range(1, n + 1):
    if i <= k:
        arr.append(s)
    else:
        arr.append(8 ** 9 + 14499)  # テキトー
print(" ".join(list(map(str, arr))))
# -*- coding: utf-8 -*-
n,k,s = map(int, input().split())

if s==10**9:
    ans = [s]*k + [1]*(n-k)
else:
    ans = [s]*k + [10**9]*(n-k)

print(*ans)
N,K,S = list(map(int,input().split()))

for i in range(K):
  print(S,end=" ")
for i in range(N-K):
  if S == 1e9:
    print(1,end=" ")
  else:
    print(S+1,end=" ")
n,k,s = map(int,input().split())
ans = []
for i in range(k):
  ans.append(str(s))
  
for j in range(n-k):
  if s != 1000000000:
    ans.append(str(s+1))
  else:
    ans.append(str(s-1))
print(' '.join(ans))
n,k,s = map(int,input().split())
ans = []
if s==10**9:
    for i in range(n):
        if i < k:
            ans.append(s)
        else:
            ans.append(1)
else:
    for i in range(n):
        if i < k:
            ans.append(s)
        else:
            ans.append(s+1)
print(*ans)
n,k,s = map(int,input().split())
ans = []
for i in range(k):
  ans.append(str(s))
  
for j in range(n-k):
  if s != 1:
    ans.append(str(s-1))
  else:
    ans.append(str(s+1))
print(' '.join(ans))
N,K,S = map(int,input().split())
if S != 10**9:
    ans = [S]*K+[S+1]*(N-K)
else:
    ans = [S]*K+[1]*(N-K)
print(*ans)
N, K, S = [int(i) for i in input().split()]

a = S

val = a
ans = []
count = 0
dummy = S+1
if S==1000000000:
    dummy = S - 1
for i in range(N):
    if(count >= K):
        val = dummy
        if val > 1000000000:
            val = 1000000000  
    else:
        count += 1
        val = a
        
    ans += [val]
    if count ==K:
            val = dummy
            count += 1

print(*ans)
def main():
    n, k, s = map(int, input().split())
    if k == 0:
        if s != 10**9:
            ans = [10**9]*n
        else:
            ans = [1]*n
    else:
        if s == 10**9:
            ans = ([s]*k)+([1]*(n-k))
        else:
            ans = [s]*(k)+[10**9]*(n-k)
    print(*ans)


main()
N, K, S = map(int, input().split())
a = [S for i in range(K)]
if S == 10 ** 9:
    S -= 2
for i in range(N - K):
    a.append(S + 1)
print(*a)
n, k, s = list(map(int, input().split()))
i = 0
list = []
while i < k:
  print(str(s) + ' ', end="")
  i = i + 1
while i < n:
  if s != 1000000000:
    print(str(s+1) + ' ',end="")
  else:
    print(str(s-1) + ' ',end="")
  i = i + 1
def main():
    N, K, S = list(map(int, input().split()))

    salt = -1 if S >= 10**9 else 1
    if K == 0:
        arr = [S+salt] *N
    else:
        arr = [] 
        for i in range(0, K):
            arr += [S]
        while len(arr) < N:
                arr += [S+salt]

    print(' '.join(map(str,arr)))

if __name__ == "__main__":
    main()
N, K, S=map(int, input().split())
if S==10**9:
  ans=[10**9]*K+[10**9-1]*(N-K)
  print(*ans)
else:
  ans=[S]*K+[S+1]*(N-K)
  print(*ans)
n, k, s = map(int, input().split())
sub = []
if s == 10**9:
    for i in range(n):
        if i < k:
            sub.append(s)
        else:
            sub.append(1)
else:
    for i in range(n):
        if i < k:
            sub.append(s)
        else:
            sub.append(s+1)
print(*sub)
N, K, S = map(int, input().split())

if S > 1:
    ans = [S for _ in range(K)] + [S-1 for _ in range(N-K)]
else:
    ans = [S for _ in range(K)] + [S+1 for _ in range(N-K)]
    
print(*ans)
N,K,S = map(int,input().split())
import numpy as np
ans = np.array([S+1]*N)
if S==10**9:
  ans = np.array([S-10**5]*N)
ans[0:K]=S
ans = list(ans)
print(' '.join(map(str,ans)))
N,K,S = map(int,input().split())
if S == 10**9:
    ans = [str(S)]*K + ["1"]*(N-K)
else:
    ans = [str(S)]*K + [str(S+1)]*(N-K)
print(" ".join(ans))
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))

n,k,s = iim()
ans = [s]*k+[1 if s==1000000000 else 1000000000]*(n-k)
print(*ans)
N, K, S = map(int, input().split())

if S == 10**9:
    A = [S]*K + [1]*(N-K)
else:
    A = [S]*K + [S+1]*(N-K)

print(' '.join(map(str, A)))
N,K,S=map(int,input().split())
ans=[S]*K+[[7,S+1][S!=10**9]]*(N-K)
print(*ans)
import collections
import math


def main():
    n, k, s = map(int, input().split())
    if s > 1:
        print(" ".join([str(s)] * k + [str(s - 1)] * (n - k)))
    else:
        print(" ".join([str(s)] * k + [str(s + 1)] * (n - k)))


if __name__ == '__main__':
    main()
n, k, s = map(int, input().split())

a = [s]*n

ans = ""

for i in range(n-k):
    if s == 1:
        a[i] = 2
    elif s == 1000000000:
        a[i] = 1000000000-1
    else:
        a[i] = s+1

for i in range(n):
    ans += " " + str(a[i])

print(ans)
N, K, S = map(int, input().split())
INF = 10**9

if K == 0:
    if S == INF:
        print(' '.join([str(INF-1) for _ in range(N)]))
    else:
        print(' '.join([str(INF) for _ in range(N)]))
    exit()

if S == INF:
    ans = [INF] * K
    ans.extend([INF-1] * (N-K))
else:
    ans = [S] * K
    ans.extend([INF] * (N-K))
print(' '.join([str(x) for x in ans]))
n, k, s = map(int, input().split())

if s < 10**9:
    ans = [s] * k + [s + 1] * (n - k)
else:
    ans = [s] * k + [1] * (n - k)

print(*ans)
N,K,S = map(int,input().split())
t = [999999999]*N
for i in range(K):
    t[i] = S
print(*t)
N, K, S = map(int,input().split())

if S != 10**9:
  res = [S]*K + [10**9]*(N-K)
else:
  res = [10**9]*K + [1]*(N-K)
  
print(*res)
#%% for atcoder uniittest use
import sys
input= lambda: sys.stdin.readline().rstrip()
def pin(type=int):
    return map(type,input().split())

#%%code

def resolve():
    bigint=10**9
    N,K,S=pin()
    if S!=bigint:
        print(*([bigint]*(N-K)+[S]*(K)))
        return
    print(*([1]*(N-K)+[bigint]*K))
    
    
#%%submit!
resolve()
[N,K,S] = list(map(int,input().split()))
cnt = 0
if S != 1:
    output = []
    for i in range(K):
        output.append(S)
    for i in range(N-K):
        cnt += 1
        if cnt < S:
            output.append(1)
        else:
            output.append(S+1)
            cnt = 0
else:
    output = []
    for i in range(K):
        output.append(S)
    for i in range(N-K):
        output.append(2)

print(" ".join(map(str, output)))
N, K, S = map(int, input().split())

anss = [S] * K
rest = N-K
if S == 10**9:
    anss += [1]*rest
else:
    anss += [S+1]*rest

print(' '.join(map(str, anss)))
import sys

input = sys.stdin.readline

N, K, S = map(int, input().split())
ans = []

large = 1000000000

if S == large:
    for _ in range(K):
        ans.append(S)
    for _ in range(N - K):
        ans.append(1)  
else:
    for _ in range(K):
        ans.append(S)
    for _ in range(N - K):
        ans.append(large)

print(*ans)
N, K, S = map(int, input().split())

ans = [0]*N
T = 10**9
if T == S:
    T = 10**9 - 1
for i in range(N):
    if i < K:
        ans[i] = S
    else:
        ans[i] = T
print(" ".join(map(str, ans)))
N,K,S=map(int,input().split())

A=[0]*N
for i in range(N):
  if i<K:
    A[i]=S
  else:
    if S==10**9:
      A[i]=S-1
    else:
      A[i]=S+1
      
print(*A)
n, k, s = map(int, input().split())
ans = [0] * n
for i in range(k): ans[i] = s
for i in range(k, n): ans[i] = s+1-2*(s==1e9)
print(*ans)
n,k,s = map(int,input().split())

if s >= 10**9:
    ans = [1]*n
else:
    ans = [10**9] * n

for i in range(k):
    ans[i] = s

print(*ans)
n, k, s = map(int, raw_input().split())
if s == 10 ** 9:
    a = [s] * k + [1] * (n - k)
else:
    a = [s] * k + [s + 1] * (n - k)
for x in a:
    print x,
print
n, k, s = map(int, input().split())

ans = []
for i in range(k):
  ans.append(s)

if s == pow(10, 9):
  s = 0
  
for j in range(k, n):
  ans.append(s+1)
  
print(' '.join(list(map(str, ans))))
[N,K,S] = list(map(int,input().split()))
cnt = 0
output = []
if S != 10**9:
    for i in range(K):
        output.append(S)
    for i in range(N-K):
        output.append(S+1)
else:
    for i in range(K):
        output.append(S)
    for i in range(N-K):
        output.append(1)

print(*output)
N, K, S = map(int,input().split())
A = [S] * K
if N > K:
    if S < 10 ** 9:
        A.extend([S + 1] * (N - K))
    else:
        A.extend([S - 1] * (N - K))

print(A[0], end = "")
for i in range(1,N):
    print(" ", end = "")
    print(A[i], end = "")
N, K, S = map(int, input().split())

ans = [S] * K

if S == 10**9:
    for _ in range(N-K):
        ans.append(1)
else:
    for _ in range(N-K):
        ans.append(S+1)
print(*ans)
n,k,s= map(int, input().split())

ans=[s]*k
if s<=100:
    zeros=[10**9]*(n-k)
else:
    zeros=[s-1]*(n-k)
ans.extend(zeros)

print(*ans)
N, K, S=map(int, input().split())
Ans=[]

for i in range(K):
    Ans.append(S)

if S!=10**9:
    for i in range(N-K):
        Ans.append(S+1)
else: 
    for i in range(N-K):
        Ans.append(1)
 
print(*Ans)
N,K,S=map(int,input().split())
A=[S]*N
for i in range(K,N):
    if S!=1:
        A[i]=S-1
    else:
        A[i]=S+1
print(*A)
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

def main():
    n, k, s = MI()
    if s == 10 ** 9:
        ans = [s] * k + [1] * (n - k)
    else:
        ans = [s] * k + [s + 1] * (n - k)
    print(*ans)

main()
N, K, S = map(int, input().split())

if S == 10**9:
    ans = [S for _ in range(K)] + [1] * (N - K)
else:
    ans = [S for _ in range(K)] + [S + 1] * (N - K)

print(' '.join(map(str, ans)))
n, k, s = map(int, input().split())

a = []

for i in range(k):
    a.append(s)

for i in range(n-k):
    if s == 1:
        a.append(2)
    else:
        a.append(s-1)

print(*a)
n, k, s = map(int, input().split())
ans = [s]*k
if s != 1: ans += [s-1]*(n-k)
else: ans += [2]*(n-k)
print(*ans)
n,k,s=map(int,input().split());print(*[s]*k+[19]*(n-k))
n, k, s = map(int, input().split())

ans = []

for i in range(n):
    if i < k:
        ans.append(s)
    else:
        if s != 10**9:
            ans.append(s+1)
        else:
            ans.append(1)

print(*ans)
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

n,k,s=map(int,input().split())
for i in range(k):
    print(s,end=" ")
if s!=10**9:
    C=10**9
else:
    C=3
for i in range(n-k):
    print(C,end=" ")
print("")
n,k,s=map(int,input().split())
if s==10**9:
  res=(str(s)+' ')*k+'1 '*(n-k)
else:
  res=(str(s)+' ')*k+(str(s+1)+' ')*(n-k)
print(res)
import sys


def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return input()
def LS(): return input().split()


n, k, s = LI()
a = []
for _ in range(k):
    a.append(s)
for _ in range(n - k):
    if s == 1:
        a.append(s + 1)
    else:
        a.append(s - 1)
print(*a)
n,k,s = map(int,input().split())

anaume = 10**9
if s == anaume:
    anaume = 10**9-1
lst1 = []


lst1 += [s]*k

lst1 += [anaume]*(n-k)

print(*lst1)
n, k, s = map(int, input().split())
if s == 1:
    ans = [s+1] * n
else:
    ans = [s-1] * n

for i in range(k):
    ans[i] = s
print(' '.join(map(lambda x: str(x), ans)))
n,k,s = (int(i) for i in input().split())
ans = ""
if s != 10**9:
    for i in range(k):
        ans += str(s) + " "
    if n > k:
        for j in range(n-k):
            ans += str(10**9) + " "
    print(ans)
else:
    for i in range(k):
        ans += str(s) + " "
    if n > k:
        for j in range(n-k):
            ans += str(1) + " "
    print(ans)
from sys import stdin
N,K,S = [int(x) for x in stdin.readline().rstrip().split()]

if S == 10**9:
    ans = [S]*K + [1]*(N-K)
else:
    ans = [S]*K + [S+1]*(N-K)
for i in ans:
    print(i,end=" ")
n, k, s = map(int, input().split())

if s == 10**9:
    for _ in range(k):
        print(s, end=" ")
    for j in range(n-k):
        print(10**9-1, end=" ")
else:
    for _ in range(k):
        print(s, end=" ")
    for j in range(n-k):
        print(10**9, end=" ")
n,k,s=map(int,input().split())
for i in range(k):
  print(s,end=" ")
for i in range(k,n):
  if s==10**9:
    print(s-1,end=" ")
  else:
    print(s+1,end=" ")
#!/usr/bin/env python3

N, K, S = map(int, input().split())
if S < 10**9:
    Ret = [S]*K + [S+1]* (N-K)
else:
    Ret = [S]*K + [1]* (N-K)
print(*Ret)
N, K, S = map(int, input().split())

A = [0]*N

for i in range(K):
    A[i] = S
    
for j in range(K, N):
    if(S+j+1 >= 10**9):
        A[j] = 1    
    else:
        A[j] = S+j+1
    
print(*A)
N, K, S = map(int, input().split())
A = [S] * K
A.extend([S + 1 if S < 10**9 else 1] * (N - K))
print(" ".join(str(a) for a in A))
N,K,S=list(map(int, input().split()))
L=[0]*N
L[:K]=[S]*K
if S==10**9:
  L[K:]=[1]*(N-K)
else:
  L[K:]=[10**9]*(N-K)
print(*L)
n,k,s=map(int,input().split())
ans=[0]*n
if s!=10**9:
    for i in range(k):
        ans[i]=s
    for i in range(k,n):
        ans[i]=10**9
else:
    for i in range(k):
        ans[i]=s
    for i in range(k,n):
        ans[i]=1
print(*ans)
n,k,s = map(int, input().split())
if s == 10**9:
    ansl = []
    for i in range(n):
        if i < k:
            ansl.append(s)
        else:
            ansl.append(1)
    print(*ansl)

else:
    ansl = []
    for i in range(n):
        if i < k:
            ansl.append(s)
        else:
            ansl.append(10**9)
    print(*ansl)
N,K,S = map(int,input().split())

if S != 10**9:
    ans = [S]*K + [S+1]*(N-K)
else:
    ans = [S]*K + [S-1]*(N-K)

print(*ans)
# C - Subarray Sum
n,k,s=map(int,input().split())
a=[]
a+=[s]*k
if s!=10**9:
    a+=[s+1]*(n-k)
else:
    a+=[1]*(n-k)
print(*a)
N,K,S=map(int,input().split())

if S!=10**9:
    ANS=[10**9 for i in range(N)]
    for i in range(K):
        ANS[i]=S
else:
    ANS=[10**9-1 for i in range(N)]
    for i in range(K):
        ANS[i]=S
print(*ANS)
N,K,S=map(int,input().split())
if S==10**9:
    l=[10**9]*K + [1]*(N-K)
    print(*l)
else:
    l=[S]*K+[10**9]*(N-K)
    print(*l)
n,k,s=map(int,input().split())
ans = (str(s) + ' ')*k + (str(s-1 or 8) + ' ')*(n-k)
print(ans[:-1])
N,K,S = map(int,input().split())
A = [S for i in range(K)]
if S<10**9:
    A += [S+1 for i in range(N-K)]
else:
    A += [1 for i in range(N-K)]
print(*A)
N, K, S = map(int, input().split())
MOD = 10 ** 9
num = S + 1 if S < MOD else S - 1 
ans = [S] * K + [num] * (N - K)
print(*ans)
N, K, S = map(int, input().split())

if S == 1e9:
    ans = [S] * K + [1] * (N - K)
else:
    ans = [S] * K + [S + 1] * (N - K)
print(*ans)
N, K, S = map(int, input().split())

for i in range(N):
  if 0 < K:
    print(S)
    K-=1
  else:
    if S-1 < 100:
      print(S+1)
    else:
      print(S-1)
N, K, S = map(int, input().split())
X = [S] * K
if S != 10 ** 9:
    Y = [10 ** 9] * (N - K)
else:
    Y = [S - 1] * (N - K)
Z = X+Y

print(*Z, sep=" ")
N, K, S = list(map(int, input().split()))


ans = [0] * N

tmp = S+1
if S+1 > 10 ** 9:
    tmp -= 2

for i in range(N):
    if i < K:
        ans[i] = S
    else:
        ans[i] = tmp

print(*ans)
N, K, S = map(int, input().split())

l = []
for i in range(K):
    l.append(str(S))

for i in range(N-K):
    if S == 1:
        l.append(str(S+1))
    else:
        l.append(str(S-1))

print(' '.join(l))
n,k,s = map(int,input().split())
a=0
b=0

list=[]

for i in range(k):
    list.append(s)

if len(list) < n:
    for i in range(n-len(list)):
        if s == 1:
            list.append(s+1)
        else:
            list.append(s-1)

for i in list:
    print(i,end=" ")
import sys
input = sys.stdin.readline
N, K, S = map(int, input().split())
res = [0] * N
for i in range(K):
  res[i] = S
for i in range(K, N):
  if S < 10 ** 9:
    res[i] = 10 ** 9
  else:
    res[i] = 1
print(*res)
MAX = 10**9

N, K, S = map(int, input().split())
if S == MAX:
    MAX = 1
A = [S]*K + [MAX]*(N-K)
print(*A)
N, K, S = map(int, input().split())

ans_list = []
for i in range(K):
    ans_list.append(S)

if S > 10**6:
    for i in range(N - K):
        ans_list.append(1)
else:
    for i in range(N - K):
        ans_list.append(10**9)

print(*ans_list)
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():
    N,K,S=map(int,input().split())
    if S<10**9:
        L=[S]*K+[S+1]*(N-K)
    else:
        L=[S]*K+[S-1]*(N-K)


    print(*L)

resolve()
n,k,s = map(int,input().split())
if s < 10 ** 9:
    z = ((str(s) + ' ') * k) + ((str(s+1) + ' ') * (n-k))
else:
    z = ((str(s) + ' ') * k) + (('1' + ' ') * (n-k))
print(z)
n,k,s = map(int,input().split())
INF = 10**9

ans = [INF] * n

if s == INF:
    ans = [1] * n

for i in range(k):
    ans[i] = s
    
print(*ans)
n,k,s=map(int,input().split())
if s==10**9:
    for i in range(k):
        print(s)
    for i in range(k,n):
        print(1)
else:
    for i in range(k):
        print(s)
    for i in range(k,n):
        print(s+1)
n,k,s = map(int,input().split())
if s != 10**9:
    ans = [s]*k+[s+1]*(n-k)
    print(*ans)
else:
  ans = [s]*k+[s-1]*(n-k)
  print(*ans)
n, k, s = map(int, input().split())
if s == 10**9:
    print(*([10**9] * k + [1] * (n - k)))
else:
    print(*([s] * k + [10**9] * (n - k)))
n,k,s=map(int,input().split())
if s!=10**9:
  ans=[s]*n
  for i in range(k,n):
    ans[i]=s+1
else:
  ans=[s]*n
  for i in range(k,n):
    ans[i]=s-1
print(*ans)
n,k,s = map(int,input().split())
if n>=k:
  if s <10**9:
    print(*([s]*k+[10**9]*(n-k)))
    exit()
  else:
    print(*([s]*k+[1]*(n-k)))
    exit()
N, K, S = map(int,input().split())
 
n = [278]*N
for i in range(K):
  n[i] = S
for i in range(N):
	print(n[i],end=' ')
# coding: utf-8
# Your code here!
N,K,S=map(int,input().split())
ans=[]
p=N-K

if S!=10**9:
    for i in range(N-K):
        ans.append(str(S+1))
    for i in range(K):
        ans.append(str(S))
else:
    for i in range(N-K):
        ans.append(str(1))
    for i in range(K):
        ans.append(str(S))
#print(ans)
#ans=' '.join(ans)

#print(len(ans))


#print(" ".join([str(n) for n in ans]))
print(*ans)
n, k, s = [int(v) for v in input().split()]

result = [s] * k

if s == 10 ** 9:
    result += [1] * (n - k)
else:
    result += [10 ** 9] * (n - k)

print(' '.join(map(str, result)))
N, K, S = map(int, input().split())

ans = []

for i in range(N):
    if i < K:
        ans.append(str(S))
    else:
        if S == 10 ** 9:
            ans.append(str(1))
        else:
            ans.append(str(S+1))

print(" ".join(ans))
N, K, S = map(int, input().split())
if S!=10**9:
    A = [S+1]*N
    for i in range(K):
        A[i] -= 1

    for c in A:
        print(c, end=" ")
else:
    A = [1]*N
    for i in range(K):
        A[i] = S
    for c in A:
        print(c, end=" ")
N, K, S = map(int, input().split())
if S != 10**9:
  ans = [S] * K + [10**9] * (N - K)
else:
  ans = [S] * K + [10**9-1] * (N - K)
print(*ans)
# 2020/01/19

n,k,s=map(int,input().split())
if s==10**9:
    rest=10**9-1
else:
    rest=10**9
ans=[s]*k+[rest]*(n-k)
print(*ans)
N, K, S = map(int, input().split())
ans = []
for _ in range(K):
    ans.append(S)

if S != 10**9:
    for _ in range(N-K):
        ans.append(S+1)
else:
    for _ in range(N-K):
        ans.append(S-1)

print(*ans)
from collections import defaultdict
from collections import deque
from collections import Counter
import itertools
import math

def readInt():
	return int(input())
def readInts():
	return list(map(int, input().split()))
def readChar():
	return input()
def readChars():
	return input().split()

n,k,s = readInts()
for i in range(k):
	print(s, end=" ")
for i in range(n-k):
	print(min(10**9-1,s+1),end=" ")
print()
def main():
    n, k, s = map(int, input().split())
    ans = []
    for i in range(k):
        ans.append(str(s))
    for i in range(n-k):
        if s < 10**9:
            ans.append(str(s+1))
        else:
            ans.append('1')

    print(' '.join(ans))


main()
n,k,s=map(int,input().split())
ans=[]
i=0
if(s!=10**9):
    for _ in range(n):
        if(i<k):
            ans.append(s)
            i+=1
        else:
            ans.append(10**9)
else:
    for _ in range(n):
        if(i<k):
            ans.append(s)
            i+=1
        else:
            ans.append(1)

print(*ans)
N, K, S = map(int, input().split())

l = [S]*K + [(S+1)%10**9]*(N-K) #長さKで要素が全てSの列（条件満たすK通り）と長さNーKの適当な列で長さN列を生成

print(*l) #*lは標準出力時にはいれつの[]を出力しないため
def main():
    n,k,s = map(int,input().split())
    ans = []
    if s<10**9:
        for i in range(k):
            ans.append(str(s))
        for i in range(k,n):
            ans.append(str(s+1))
        print(' '.join(ans))
    else:
        for i in range(k):
            ans.append(str(s))
        for i in range(k,n):
            ans.append(str(1))
        print(' '.join(ans))


if __name__=='__main__':
    main()