peterverebics/CodeNet_Python_118 huggingface dataset:
n, k, s = map(int,input().split())
anslist = [int(1e10)] * n
for i in range(k):
    anslist[i] = s
for i in range(len(anslist)):
    print(anslist[i])
N,K,S=map(int,input().split())
A=[0 for z in range(N)]
if K==N:
  A=[S for z in range(N)]
elif S==1:
  for i in range(N):
    if i <=K-1:
      A[i]=1
    else:
      A[i]=2
else:
  for i in range(N):
    if i%2==0 and i <=K:
      A[i]=1
    elif i%2==1 and i<=K:
      A[i]=S-1
    else:
      A[i]=S+1
print(*A)
n, k, s = map(int, input().split())
o = 10 ** 9
ans = []
if s == 10 ** 9:
    o = 1

for _ in range(k+1):
    ans.append(s)
for _ in range(n-k-1):
    ans.append(o)
    
print(' '.join(map(str, ans)))
N, K, S = map(int,input().split())
print([S]*K + [0]*(N-K))
n,k,s=map(int, input().split())
lis = [s]*k
for i in range(n-k):lis.append(0)
print(*lis)
n,k,s=map(int,input().split())
gu=s//2
ki=s-gu
tmp=abs(10*9-gu)
if s==10*9:
    kz=1
else :
    kz=s+1
if k==0:
    print((str(kz)+" ")*n)
    exit()
for i in range(n):
    if i==k+1:
        print((str(tmp)+" ")*(n-k-1))
        exit()
    if i%2==0:
        print(gu,end=" ")
    elif i%2==1:
        print(ki,end=" ")
N,K,S = map(int,input().split())

print(*((S,)*K + (S+1,)*(N-K)))
def main():
    N, K, S = list(map(int, input().split()))

    arr = [] 
    for i in range(0, K):
        arr += [S]
    while len(arr) < N:
        arr += [S+1]
    print(' '.join(map(str,arr)))

if __name__ == "__main__":
    main()
#!/usr/bin/env python3

N, K, S = map(int, input().split())
Ret = [S]*K + [10**9+1]* (N-K)
print(*Ret)
#!/usr/bin/env python3

N, K, S = map(int, input().split())
Ret = [S]*K + [10**9]* (N-K)
print(*Ret)
N, K, S = map(int, input().split())
if N == K:
    print(*[S] * K)
    quit()
if S % 2 == 1:
    ki = S // 2
    gu = S // 2 + 1
    ans = []
    for i in range(K + 1):
        if i % 2 == 0:
            ans.append(ki)
        else:
            ans.append(gu)
else:
    ans = []
    #K -= 1
    for i in range(K + 1):
        ans.append(S // 2)
for i in range(N - (K + 1)):
    ans.append(S // 2 + 3)
print(*ans)
N,K,S = map(int,input().split())
A = [10**10-1]*N
if S != 10**10-1:
    for i in range(K):
        A[i] = S
else:
    for i in range(N-K):
        A[i] = 10**10-2
print(*A)
n,k,s=map(int,input().split())
ans=[]
for i in range(k):
  ans.append(s)
for i in range(n-k):
  ans.append(s-1)
print(*ans)
N, K, S = map(int, input().split())

ans = [S]*K
ans += [S+1]*(N - K)

print(ans)
N,K,S = map(int,input().split())
A = [0]*N
if S == 10**9:
    ans = [S]*K+[10**8]*(N-K)
    print(*ans,sep=" ")
else:
    ans = [S]*K+[10**9]*(N-K)
    print(*ans,sep=" ")
n,k,s = map(int,input().split())
li = [s]*k + [(s+1)]*(n-k)
print(*li)
N,K,S = map(int,input().split())

anslist = []

if not S == 10*9:
    for i in range(K):
        anslist.append(S)
    for i in range(N-K):
        anslist.append(10**9)
else:
    for i in range(K):
        anslist.append(S)
    for i in range(N-K):
        anslist.append(1)

print(S)

ansString = [str(i) for i in anslist]

print(" ".join(ansString))
n,k,s=map(int,input().split())
ans=[]
for i in range(k):
    ans.append(s)
if s==1:
    for i in range(n-k):
        ans.append(2)
else:
    for i in range(n-k):
        ans.append(1)
print(ans)
def main():
    N,K,S = map(int,input().split())
    mx = 10**9
    Ans = [S]*K + [mx]*(N-K)
    print(*Ans,sep=" ")

if __name__ == "__main__":
    main()
N, K, S = map(int, input().split())
base = S // 2
remain = S - 2 * base
C = [base, base + remain]
ANS = [c for c in C]
count = 0
for i in range(K - 1):
    ANS.append(C[count])
    count = (count + 1) % 2

dummy = base + 1
if dummy == base + remain:
    dummy += 1
if dummy == S:
    dummy += 1
for i in range(N - K - 1):
    ANS.append(dummy)
print(' '.join(map(str, ANS)))
N,K,S = map(int,input().split())

A = [S for _ in range(K)]
A += [S+1 for _ in range(N-K)]

for a in A[:-1]:
    print('{},'.format(a), end = "")
print('{}'.format(A[-1]))
N,K,S=map(int,input().split())
ans=[S for i in range(K)]
if S==10**9:
  ans2=[S+1 for i in range(N-K)]
else:
  ans2=[S+1 for i in range(N-K)]
ans=ans+ans2
print(*ans)
N, K, S = map(int, input().split())
lis = []
for i in range(K):
  lis.append(S)
for i in range(N-K):
  lis.append(S+1)
print(lis)
N,K,S = map(int,input().split())

ans = [0]*N

if K == 0:
    for i in range(N):
        ans[i] = 1e10
elif N == K:
    for i in range(N):
        ans[i] = S
elif S%2 == 0:
    for i in range(0,K+1):
        ans[i] = S//2
    for i in range(K+1,N):
        ans[i] = int(1e16)
elif S%2 == 1:
    for i in range(K):
        ans[i] = S
    for i in range(K,N):
        ans[i] = int(1e16)
    

print(*ans)
import numpy as np

N,K,S = map(int,input().split())
A = np.zeros(N,dtype="int64")

for i in range (0,K):
  A[i] = S
for i in range (K,N):
  A[i] = S + 1

for i in range (0,N):
  print(A[i], end=" ")
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)
s = input().split()
n, k, s = int(s[0]), int(s[1]), int(s[2])
res = [str(s)] * k + [str(s+1)] * (n-k)
print(' '.join(res))
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())

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

for i in range(n - k):
    print(1, end=' ')
#C
n,k,s = map(int,input().split())

ans = [1 for _ in range(n)]

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

for j in range(n-k):
    ans[k+j] = s//2 + 2

print(*ans)
# https://atcoder.jp/contests/keyence2020/tasks/keyence2020_c

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

ans = [10 ** 9 + 1] * n
for i in range(k):
    ans[i] = s
print(*ans)
n, k, s = map(int, input().split())
res = []
for i in range(k):
    res.append(s)
while len(res) < n:
    res.append(s - 1)
for i in range(n):
    print(res[i])
n, k, s = map(int, input().split())

if k == 0:
    ans = [s]*n
elif s == 1:
    ans = [1]*n
else:
    if n%k == 0:
        ans = [s-1, 1]*(n//k)
    else:
        ans = [s-1, 1]*(n//k) + [s-1, 1]*(n%k)
        ans = ans[:n]

print(*ans)
n, k, s = map(int, input().split())
if s != 1:
  ans = [s]*k+[1]*(n-k)
else:
  ans =[s]*k+[2]*(n-k) 
print(" ".join(list(map(str,ans))))
n, k, s = map(int, input().split())
ans = [0 for i in range(n)]
inf = 10**9
for i in range(n):
    if i < k:
        ans[i] = s
    else:
        ans[i] = inf
for i in range(n):
    print("{} ".format(ans[i]),end = "")
n, k, s = map(int, input().split())
lis = [0]*n
count = 1
for i in range(k):
    lis[i] = s
for j in range(k, n):
    lis[j] = 10 ** 5 - count
    count += 1
print(" ".join(map(str, lis)))
n, k, s = map(int, input().split())
print([s] * k + [s+1] * (n-k))
n,k,s = list(map(int, input().split()))

print([s]*k+[0]*(n-k))
from sys import stdin

n, k, s = map(int, stdin.readline().rstrip().split())
flag = 0

for i in range(n):
    if flag < k:
        print(s)
        flag += 1
    else:
        if s == 10 ^ 9 or s == 1:
            print(1)
        else:
            print(s-1)
n, k, s = map(int, input().split())
if s % 2 == 0:
  a = [s//2]*(k+1)+[10**9]*(n-k-1)
if s % 2 == 1:
  if k % 2 == 0:
    a = [s//2, s//2 + 1]*(k//2) +[s//2] +[10**9]*(n-k-1)
  else:
    a = [s//2, s//2 + 1]*(k//2+1) + [10**9]*(n-k-1)
print(*a)
def C():
    temp = [int(n) for n in input().split()]
    N = temp[0]
    K = temp[1]
    S = temp[2]
    ans = [str(S)]*K + [str(S+1)]*(N-K)
    print(' '.join(ans))
C()
n, k, s = map(int, input().split())

res = []
for i in range(n):
    if i + 1 <= k:
        res.append(s)
    else:
        res.append(s + 1)
print(*res)
N, K, S = map(int, open(0).read().split())

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

a = [0 for i in range(n)]

b = 10 ** 11

for i in range(n):
    if i < k:
        a[i] = s
    else:
        a[i] = b

print(" ".join(map(str,a)))
n,k,s=map(int,input().split())
ans=[s]*n
for i in range(n):
  if i>=k:
    ans[i]=0
print(*ans)
N, K, S = map(int, input().split())
A = [0]*N
cnt = 0
for i in range(N):
  A[i] = S
  cnt += 1
  if cnt == K:
    break
for i in range(N):
  if A[i] == 0:
    if S == 10**9:
      A[i] = 1
    else:
      A[i] = 10**9
print(*A)
N, K, S = map(int, input().split())
arr = [0] * N
for i in range(N):
    if i % 2:
        arr[i] = S - 1
    else:
        arr[i] = 1
if N - 1 == K:
    print(arr)
else:
    fill_value = 10 ** 5 if S == 10 ** 9 else 10 ** 9
    for i in range(N - 1 - K):
        arr[i] = fill_value
    print(arr)
n,k,s = input().split()
ans = ""
for i in range(0,int(k)):
    ans += s+" "
l = int(n)-int(k)
a = int(s) + 1
for i in range(0,l):
    ans += str(a)+" "
print(ans)
n,k,s=map(int,input().split())
if k==n:print(*[s]*n);exit()
a=[s-1]
for i in range(1,k+1):a.append(s-a[-1])
x=10**9
if s==x:x=10**8
for i in range(n-len(a)):a.append(x)
print(*a)
N, K, S = map(int, input().split())

if K == 0:
    print(0)
    exit()

if N == 1:
    print(S)
    exit()

for j in range(K):
    print(S, end=" ")

for i in range(N - K):
    print(S + 1, end=" ")
N, K, S = map(int, input().split())
L = []
for i in range(N):
    if i < K:
        L.append(str(S))
    else:
        L.append(str(10**9))
print(' '.join(L))

# S S S S S ... N個続くとき
# Sとなるl, rが (1, 1), (2, 2), ... , (N, N) とN個ある

# X + Y = S
# X Y X Y X Y ... N個続くとき
# Sとなるl, rが (1, 2), (2, 3), ..., (N - 1, N) と N - 1個ある

# 100 100 100 100 : K=N
# 100 100 100 0   : K=N-1
# 100 100 0   0   : K=N-2
def main():
    n,k,s = map(int,input().split())
    ans = []
    for i in range(k):
        ans.append(str(s))
    for i in range(k,n):
        ans.append(str(s+1))
    print(' '.join(ans))

if __name__=='__main__':
    main()
n,k,s=map(int,input().split())
ans=[s]*k+[s+1]*(n-k)
print(ans)
N, K, S = map(int, input().split())

ans = []

for i in range(N):
    if i < K:
        ans.append(str(S))
    else:
        ans.append(str(1))

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

ans = [s+1] * n

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

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

ans = []

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())

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

print(*ans)
n,k,s = list(map(int, input().split()))
ans=[s]*k+[s+1]*(n-k)
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(s+1,end=" ")
N, K, S = map(int, input().split())

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

print(*l) #*lは標準出力時にはいれつの[]を出力しないため
#! coding utf-8

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

padnum = 10**9 if s is not 10**9 else 1


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

for i in range(n-k):
    print(padnum, end=" ")

# # print(h, w, n)
# # print(n//h+1, n//w+1)
# ret = min(ceil(n/h), ceil(n/w))

# print(ret)
n,k,s=map(int,input().split())
t1=[s for i in range(k)]
t2=[s+1 for j in range(n-k)]
for i in range(k):
    print(s,end=" ")
for j in range(n-k):
    print(s+1,end=" ")
n,k,s = map(int,input().split())

L = [1,s-1]
li = []

if s < 10**9:
    if k%2 == 1:
        li = L*(k//2+1)
    else:
        li = L*(k//2) + [1]

    li = li + [s+1] *(n-len(li))
    print(*li)
    exit()
elif s == 10**9:
    li = [s]*k + [1]*(n-k)
    print(*li)
N,K,S = map(int,input().split())
t = [12839476538]*N
for i in range(K):
    t[i] = S
print(*t)
n,k,s=map(int,input().split())
for i in range(k):
  print(s,end=" ")
for i in range(n-k):
  print(s+1,end=" ")
  if i==n-k-1:
    print()
n,k,s=map(int,input().split())
ans = (str(s) + ' ')*k + (str(s-1) + ' ')*(n-k)
print(ans[:-1])
n,k,s=map(int,input().split())
gu=s//2
ki=s-gu
for i in range(1,10**5):
    if s!=i+gu and s!=i+ki and s!=i+i:
        kz=i
        break
if k==0:
    print((str(kz)+" ")*n)
for i in range(n):
    if i==k+1:
        print((str(kz)+" ")*(n-k-1))
        exit()
    if i%2==0:
        print(gu,end=" ")
    elif i%2==1:
        print(ki,end=" ")
N, K, S = map(int, input().split())
if S % 2 == 0:
    A = [int(S / 2)] * (K + 1)
    for i in range(N - len(A)): A.append(735477)
    print(*A)
else:
    A = [int(S / 2), int(S / 2) + 1] * int(K / 2)
    A.append(int(S / 2))
    for i in range(N - len(A)): A.append(735477)
    print(*A)
n,k,s=(int(x) for x in input().split())
ans=[]
for i in range(k):
	ans.append(s)
while len(ans)<n:
	ans.append(0)

print(' '.join(map(str, ans)))
def solve():
    N, K, S = map(int, input().split())
    ans = [S for _ in range(K)] + [S + 1 for _ in range(N - K)]
    print(' '.join(map(str, ans)))


if __name__ == '__main__':
    solve()
n, k, s = map(int, input().split())
A = [s]*k + [s-1]*(n-k)
print(*A)
n, k, s = map(int, input().split())
if not s!=10**9:
    A = [s]*k + [s+1]*(n-k)
else:
    A = [s]*k + [s-1]*(n-k)
print(*A)
N,K,S = map(int,input().split())
if S == 10**9: print(" ".join((str(S)*K)+("1"*(N-K))))
else: print(" ".join((str(S)*K)+(str(S+1)*(N-K))))
n, k, s = map(int, input().split())

a = [0 for i in range(n)]

b = 10 ** 10

for i in range(n):
    if i < k:
        a[i] = s
    else:
        a[i] = b

print(" ".join(map(str,a)))
n, k, s = map(int, input().split())

for i in range(1, n+1):
    if i <= k+1:
        if s %2 == 1 and i % 2 == 1:
            print(s//2 + 1)
        else:
            print(s//2)
    else:
        print(10**10)
def main():
    INF = 10**9 + 7
    N, K, S = (int(i) for i in input().split())
    if N == K:
        ans = [S]*K
    elif S % 2 == 1:
        v1, v2 = S//2, 0--S//2
        ans = [v1 if i % 2 == 0 else v2 for i in range(K+1)] + [INF]*(N-K-1)
    else:
        ans = [S//2]*(K+1) + [INF]*(N-K-1)
    return print(*ans)


if __name__ == '__main__':
    main()
N, K, S = map(int, input().split())
if N==K:
  A = [S]*N
  print(*A)
  exit()
if S%2 == 0:
  a = S//2
  b = S//2
else:
  a = S//2+1
  b = S//2
A = [0]*N
for i in range(N):
  if i%2==0:
    A[i] = a
  else:
    A[i] = b
cnt = 0
for i in range(N-1):
  if A[i]+A[i+1] == S:
    cnt += 1
ind = N-1
while cnt > K:
  if S == 10**9:
    A[ind] = S-1
  else:
    A[ind] = S+1
  cnt -= 1
  ind -= 1
print(*A)
n,k,s=map(int,input().split())
if s!=1:
  ans=[s]*n
  for i in range(k,n):
    ans[i]=s+1
else:
  ans=[1]*n
  for i in range(k,n):
    ans[i]=2

print(*ans)
n,k,s=map(int,input().split())
ans=[]
for i in range(n):
    if i+1<=k:
        ans.append(s)
    else:
        ans.append(s+1)
print(ans)
from math import ceil
N, K, S = map(int,input().split())

fill = 10**9
if S == 10**9: fill-=2
if N == K:
  for i in range(K): print(S,end=" ")
else:
  for i in range(ceil(K/2)): 
    print(S-1,end=" ")
    print(1,end=" ")
  if K%2 == 0: 
    print(S-1,end=" ")  
    for i in range(N-ceil(K/2)*2-1):
      print(fill,end=" ")
  else:
    for i in range(N-ceil(K/2)*2):
      print(fill,end=" ")
n, k, s = map(int, input().split())
if s%2==0:
    A = [s//2]*(k+1)+[s+1]*(n-k-1)
else:
    A = [s+1]*n
    A[0] = s//2
    t = 0
    for i in range(1, n):
        A[i] = s-A[i-1]
        t += 1
        if t==k:
            break
print(*A)
import math


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


print(n,k,s)

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


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

for i in range(k,n):
    print(blank,end=" ")
print()
import bisect,collections,copy,itertools,math,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def main():
    n,k,s = LI()
    ans = [s]*k + [s+1]*(n-k)
    print(*ans)
main()
import sys
def main():
    N, K, S = [int(_) for _ in input().split()]
    A = []
    if K == 0:
        A = [S+1] * N
        print(*A)
        sys.exit()
    for i in range(N):
        if i < K:
            A.append(S)
        else:
            A.append(1)
    print(*A)
main()
[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(1)
else:
    for i in range(K):
        output.append(S)
    for i in range(N-K):
        output.append(S+1)

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

l=[s]*k+[0]*(n-k)
print(l)
N,K,S=map(int,input().split())

A=[S]*K
A=A+[10**9+1]*(N-K)
s=""
for i in range(N):
    s=s+str(A[i])+" "
print(s)
N,K,S = map(int,input().split())
if N == 10**9:
    ans = [str(S)]*K + ["1"]*(N-K)
else:
    ans = [str(S)]*K + [str(S+1)]*(N-K)
print(" ".join(ans))
N, K, S = map(int, input().split())
INF = 10**9
ans = []
if S % 2 == 0:
    k = K // 2 + 1
    ans.extend([S//2, S//2] * k)
    if K % 2 == 0:
        ans.pop()
    ans.extend([INF] * (N-len(ans)))
else:
    k = K // 2 + 1
    ans.extend([S//2, S//2+1] * k)
    if K % 2 == 0:
        ans.pop()
    ans.extend([INF] * (N-len(ans)))


print(' '.join([str(x) for x in ans]))
n, k, s = map(int,input().split())
ans = [10**10 for i in range(n)]
ans[0] = s
for i in range(1,k):
    ans[i] = 0

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

a = [s - 2 for i in range(n)]

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

print(" ".join(map(str,a)))
n, k, s = map(int, input().split())
ans = ''
for i in range(n):
  if i < k:
    ans += str(s) + ' '
  elif s==1:
    ans += '2 '
  else:
    ans += '1 '
print(ans[:-1])
#C
n,k,s = map(int,input().split())

ans = [1 for _ in range(n)]

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

for j in range(n-k):
    ans[k+j] = s//2 + 1

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

for i in range(K):
  l[i] = S
  if N != K:
    if S != 1000000000:
      for j in range(K,N):
        l[j] = 1000000000
    else:
      for j in range(K,N):
        l[j] = 999999999
  
', '.join(map(str, l))
print(l)
# coding: utf-8
# Your code here!
N,K,S=map(int,input().split())
ans=[]
p=N-K
if p==N:
    for i in range(N):
        ans.append(str(S+1))
else:
    for i in range(N-K):
        ans.append('10000000000')
    for i in range(K):
        ans.append(str(S))

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

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

ans = []
# if S % 2 == 0:
#     for i in range(K):
#         ans.append(S)
#     for i in range(N-K):
#         ans.append(S+1)
# else:
#     x = S // 2

for i in range(K):
    ans.append(S)
for i in range(N-K):
    ans.append(S+1)


ans = [str(i) for i in ans]
print(" ".join(ans))
from collections import defaultdict
def solve():
    N, K, S = map(int, input().split())
    ans = [S] * K + [S+1] * (N-K)
    print(*ans)
    
if __name__ == '__main__':
    solve()
def solve(N,K,S):
    if K != 0 and K != N:
        for i in range(0, K):
            print(S)
        for i in range(K, N):
            print(S+1)
    elif K == 0:
        for i in range(N):
            print(S+1)
    elif K == N:
        for i in range(N):
            print(S)
N ,K ,S = map(int,input().split())
solve(N,K,S)
from sys import stdin

n, k, s = map(int, stdin.readline().rstrip().split())
flag = 0

for i in range(n):
    if flag < k:
        print(s)
        flag += 1
    else:
        if s != 10 ^ 9:
            print(1)
        else:
            print(s+1)
# https://atcoder.jp/contests/keyence2020/tasks/keyence2020_c

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

ans = [10 ** 9 + 1] * n
for i in range(n - k, n):
    ans[i] = s
print(ans)
# -*- coding: utf-8 -*-

[N, K, S] = [int(i) for i in input().split()]

A = []
k_number = K
for n in range(N):
    if k_number > 0:
        A.append(S)
        k_number -= 1
    else:
        A.append(S-1)

for a in A[:N-1]:
    print('{} '.format(a), end='')

print(A[N-1])
n,k,s=map(int,input().split())
ans=[s]*k+[10**9]*(n-k)
print(*ans)
N,K,S=[int(i) for i in input().split()]
res=[10**9]*N
for i in range(K):
    res[i]=S
print(res)
n, k, s = map(int, input().split())
sub = []
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())
ans = [str(S)] * K

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

if s>n-k:
  t = n-k
else:
  t = n
for i in range(t):
  su[i] = s+1

print(*su)
N, K, S=map(int, input().split())
Ans=[]
for i in range(10,100):
    if S%i !=0:
        c=i
        break
sum=0
for i in range(K-1):
    Ans.append(S)

for i in range(N-K+1):
    Ans.append(c)
    sum=sum+c

print(Ans)
n,k,s=map(int,input().split())
ans=[s]*k
if n-k>0:
  ans1=[]
  if s==10**9:
    ans1=[10**9-1]*(n-k)
  else:
    ans1=[s-1]*(n-k)
  ans[len(ans):len(ans)]=ans1
print(' '.join(map(str,ans)))
N,K,S=map(int,input().split())
A=[0 for z in range(N)]
for i in range(N):
  if i <=K-1:
    A[i]=S
  else:
    A[i]=S+1
print(*A)
(N, K, S) = list(map(int, input().split()))
a = ['1'] * N
a[K-1] = str(S-K+1)
print(' '.join(a))
n, k, s = map(int, input().split())
if k == n:
    print(" ".join([str(s) for _ in range(n)]))
    exit()
for i in range(n):
    if i <= k:
        print(s)
    else:
        print(10 ** 9)
n, k, s = map(int, input().split())

la = list()

if s == 1:
    l = [1] * k + [2] * (n-k)
    l = [str(i) for i in l]
    print(" ".join(l))

elif s == 10**9:
    l = [s] * k + [1] * (n-k)
    l = [str(i) for i in l]
    print(" ".join(l))
    
else:
    for i in range(n):
        la.extend([1, s-1])
    l = la[:k+1]
    for i in range(n-k-1):
        l.append(s+1)

    l = [str(i) for i in l]
    print(" ".join(l))
n,k,s = map(int,input().split())
ans = [10**9]*n
for i in range(k):
    ans[i] = s
print(" ".join(map(str,ans)))
n,k,s=map(int,input().split())
ans=[]
for i in range(k):
  ans.append(s)
for i in range(n-k):
  ans.append(s+1)
print(*ans)
N,K,S = map(int,input().split())
t = [1000000001]*N
for i in range(K):
    t[i] = S
print(*t)
N, K, S = map(int, input().split())
ans = [S] * K
ans.extend([0] * (N - K))
print(' '.join([str(x) for x in ans]))
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
    """
    sum[Al,,,Ar] = Sの部分和がちょうどK個。
    """
    n, k, s = map(int, input().split())
    if n == k:
        r = [s] * k
    else:
        if s != 1:
            r = [s] * (k - 1) + [s - 1] * 1 + [1] * (n - k)
        else:
            r = [1] * k + [100] * (n - k)
    print(*r, sep=' ')

if __name__ == '__main__':
    main()
def main():
    N, K, S = tuple(int(i) for i in input().split())

    ans = [S + 1 for _ in range(N)]
    for i in range(N):
        if i < K:
            ans[i] = S

    print("".join([str(i) for i in ans]))


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

ans = [-1] * n

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

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