peterverebics/CodeNet_Python_118 huggingface dataset:
n , k , s = map(int,input().split())
l = []
for i in range(k):
    l.append(s)
if s == 1:
    t = 3
elif s == 10**9:
    t = 1
else:
    t = s + 1

for i in range(n-k):
    l.append(t)


print(' '.join(map(str, l)))
n, k, s = map(int, input().split())
ans = []
for i in range(k):
    ans.append(s)
for i in range(n - k):
    if s + 1 <= 10 ** 9:
        ans.append(s + 1)
    else:
        ans.append(1)
print(*ans)
n,k,s = map(int, input().split( ))
#editorial
#s..s,s+1,...s+1
#またはs,,,s,1,,,1
for i in range(k):
        print(s,end = " ")
if s<10**9:
    for i in range(k,n):
        print(s+1,end = " ")
else:
    for i in range(k,n):
        print(1,end = " ")
N,K,S = map(int,input().split())
if S == 10**9:
    A = [S]*K + [S-1]*(N-K)
else:
    A = [S]*K + [S+1]*(N-K)
print(*A)
[N, K, S] = [int(i) for i in input().split()]

ans = [str(S)]*N

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

for i in range(k):
    print(s,end=" ")
for i in range(n-k):
    if s==10**9:
        print(s-1,end=" ")
    else:
        print(s+1,end=" ")
print()
n, k, s = map(int, input().split())
if k == 0:
    if s == 10**9:
        print(' '.join([str(s - 1)]*n))
    else:
        print(' '.join([str(s + 1)]*n))
else:
  first = [str(s)]*k
  if s == 1:
    second = [str(2)]*(n - k)
  else:
    second = [str(max(1, s - 1))]*(n - k)
  print(' '.join(first + second))
N,K,S=map(int,input().split())
A=[]
if 1<=S<10**9:
  for i in range(K):
    A.append(S)
  for i in range(N-K):
    A.append(S+1)
  print(*A)
else:
  for i in range(K):
    A.append(S)
  for i in range(N-K):
    A.append(S-1)
  print(*A)
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)
N,K,S=map(int,input().split())
ans=[]
for _ in range(K):
  ans.append(S)
for _ in range(N-K):
  ans.append(S+1 if S!=10**9 else 1)
for i in range(N):
  print(ans[i])
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

N,K,S = map(int,read().split())

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

print(*A)
import sys

readline = sys.stdin.readline
readlines = sys.stdin.readlines
ns = lambda: readline().rstrip() # input string
ni = lambda: int(readline().rstrip()) # input int
nm = lambda: map(int, readline().split()) # input multiple int 
nl = lambda: list(map(int, readline().split())) # input multiple int to list

n, k, s = nm()
ans_h = [str(s) for _ in range(k)]
if s==10**9 :
    ans_t = ['1' for _ in range(n-k)]
else:
    ans_t = [str(s+1) for _ in range(n-k)]
print(' '.join(ans_h + ans_t))
N, K, S = map(int, input().split())
ans = [str(ele) for ele in ([S] * K + [(S - 1) if S != 1 else 10**9] * (N - K))]
print(" ".join(ans))
# coding: utf-8
N, K, S = map(int, input().split())
L = []
for i in range(N):
    if i < K:
        L.append(S)
    else:
        L.append(99999989)
print(*L)
n ,k ,s = map(int, input().split())

a = [s] * n

for i in range(k,len(a)):
    if s != 1:
        a[i] -= 1
    else:
        a[i] += 1

print(" ".join(map(str, a)))
n, k , s = map(int, input().split())
ans = []
for i in range(n):
    if k != 0:
        ans.append(s)
        k -= 1
    else:
        ans.append(s+1 if s != 10**9 else s-1)
print(" ".join([str(x) for x in ans]))
n,k,s=map(int,input().split())
a=[]
for i in range(n):
    if i < k:
        a.append(s)
    elif s<10**9:
        a.append(s+1)
    else:
        a.append(1)
print(*a)
N, K, S = map(int, input().split())
S2 = S-1 if S == 1000000000 else S+1
As = [S]*K+[S2]*(N-K)
print(" ".join(map(str, As)))
# coding: utf-8

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

if S < 10**9:
    for _ in range(K):
        print(S, end=" ")
    for _ in range(N-K-1):
        print(S+1, end=" ")
    if K != N:
        print(S+1)
else:
    for _ in range(K):
        print(S, end=" ")
    for _ in range(N-K-1):
        print(S-1, end=" ")
    if K != N:
        print(S-1)
#import collections
import sys
input = sys.stdin.readline

#n = int(input())
#l = list(map(int, input().split()))

'''
A=[]
B=[]
for i in range():
    a, b = map(int, input().split())
    A.append(a)
    B.append(b)'''
#import copy
#import numpy as np

n, k, s = map(int, input().split())
ans = [s+1 if s != 10**9 else 1 for i in range(n)]
#print(ans)
for i in range(k):
    ans[i]=s
for i in ans:
    print(i)
n,k,s = map(int,input().split())
rem = s+1
if rem > 10**9:
    rem = 1
li = []
for i in range(n):
    if i < k:
        li.append(s)
    else:
        li.append(rem)
print(*li)
#template
from collections import Counter
def inputlist(): return [int(i) for i in input().split()]
#template
N,K,S = inputlist()
ans = []
for i in range(K):
    ans.append(S)
for i in range(N-K):
    if S == 1:
        ans.append(S+1)
    else:
        ans.append(S-1)
print(*ans)
N, K, S = [int(_) for _ in input().split()]

a = [S for _ in range(K)]
if S != 1:
    b = [S - 1 for _ in range(N-K)]
else: 
    b = [S + 1 for _ in range(N-K)]

print(" ".join([str(v) for v in a + b]))
N,K,S=map(int,input().split())
ans=[S]*K

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

ans = [None] * N
for i in range(N):
    if i < K:
        ans[i] = S
    else:
        if S + 1 <= 1000000000:
            ans[i] = S + 1
        else:
            ans[i] = 1
            
print(' '.join(map(str, 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())

for i in range(n):
    if i < k:
        print(s, end=" ")
    else:
        if s == 10**9:
            print(1, end=" ")
        else:
            print(s+1, end=" ")
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())
ans = []
for k in range(K):
    ans.append(S)
if S < 10**9:
    for k in range(K,N):
        ans.append(10**9)
else:
    for k in range(K,N):
        ans.append(10**9-1)
print(*ans)
def resolve():
    n,k,s=map(int,input().split())
    l1=[s]*k
    if s!=10**9:
        l2=[s+1]*(n-k)
    else:
        l2=[1]*(n-k)
    print(*(l1+l2))
resolve()
n,k,s=map(int,input().split())
for i in range(k):
  print(s,end=" ")
  if i==k-1:
    if n==k:
      print()
if s!=10**9: 
  for i in range(n-k):
    print(s+1,end=" ")
    if i==n-k-1:
      print()
else:
  for i in range(n-k):
    print(1,end=" ")
    if i==n-k-1:
      print()
N, K, S = map(int, input().split())
if S == 10 ** 9:
    ans = [10 ** 9] * K
    ans.extend([1] * (N - K))
else:
    ans = [S] * K
    ans.extend([S + 1] * (N - K))
print(' '.join([str(x) for x in ans]))
N, K, S = map(int, input().split())

if S != 10 **9:
    N = [S+1] * N    
else:
    N = [1] * N

for i in range(K):
        N[i] = S

print(*N)
import sys

input = sys.stdin.readline


def main():
    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(" ".join(map(str, ans)))


if __name__ == "__main__":
    main()
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")



n,k,s = map(int, input().split())
if s==10**9:
    a = [10**9]*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
if S!=10**9:
    add=10**9
else:
    add=10**9-1
ans=ans+[add]*(N-K)
print(*ans)
N, K, S = map(int, input().split())
a = 1 if S==10**9 else S+1
A = [S]*K + [a] * (N-K)
print(*A)
n,k,s=map(int,input().split())
if s<10**9:
    x=[s]*k
    y=[s+1]*(n-k)
else:
    x=[s]*k
    y=[1]*(n-k)
z=" ".join(map(str,x))+" "+" ".join(map(str,y))
print(z)
n,k,s = map(int,input().split())
ans = []
if (s < 1000000000):
    for i in range(n):
        if (i < k):
            ans.append(s)
        else:
            ans.append(s + 1)
elif (s == 1000000000):
    for j in range(n):
        if (j < k):
            ans.append(s)
        else:
            ans.append(1)
ans = map(str,ans)
print(' '.join(ans))
n, k, s = map(int, input().split())
if s == 10**9:
    arr = [s]*k + [s-1]*(n-k)
else:
    arr = [s]*k + [s+1]*(n-k)

print(*arr)
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())
if s != 10**9:
    ans=[s if i <= k-1 else s+1 for i in range(n)]
else:
    ans=[s if i <= k-1 else s-1 for i in range(n)]
print(*ans)
n,k,s=map(int,input().split())
ans=[s]*k
if n-k>0:
  ans1=[]
  if s==10**9:
    ans1=[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())

d = S
if S == int(1e9):
    d -= 1
else:
    d += 1

ans = [1 for _ in range(N)]
for i in range(N):
    if K > 0:
        ans[i] = S
        K -= 1
    else:
        ans[i] = d

print(*ans)
import sys
input = sys.stdin.readline


def main():
    N, K, S = [int(x) for x in input().split()]

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

    print(*ans)



if __name__ == '__main__':
    main()
N, K, S = map(int ,input().split())


if N == K:
    A = [S] * N
elif S == 10**9:
    A = [S]*K + [1]*(N-K)
elif K == 0:
    A = [S+1] * N
elif S == 1:
    A = [1]*K + [2]*(N-K)
else:
    A = [S+1] * N
    x = S // 2
    y = S - x
    for i in range(K+1):
        if i%2 == 0:
            A[i] = x
        else:
            A[i] = y

print(' '.join(map(str, A)))
N,K,S = map(int,input().split())
if S == pow(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:
    ans = [S] * K + [S+1] * (N-K)
else:
    ans = [S] * K + [S-1] * (N-K)

print(" ".join(map(str,ans)))
# coding: utf-8
import math
n, k, s = map(int,input().split())
#T = list(map(int,input().split()))
A = [str(s)] * k
if s==10**9:
    A += [str(s-1)] * (n-k)
else:
    A += [str(s+1)] * (n-k)
    
print(' '.join(A))
n, k, s = map(int, input().split())
F = 1000000000
A = []
if s == F:
    for i in range(k):
        A.append(s)
    for i in range(n-k):
        A.append(1)
else:
    for i in range(k):
        A.append(s)
    for i in range(n-k):
        A.append(s+1)

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

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

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

ls_a=[s]*k
ls_b=[x]*(n-k)
print(" ".join(list(map(str,ls_a+ls_b))))
N,K,S=map(int,input().split())
a=(S+1)%pow(10,9)

answer=[S]*K+[a]*(N-K)

print(" ".join(map(str,answer)))
def main():
    import sys
    input = sys.stdin.readline

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

    if S < 10**9:
        ans = [10**9] * N
        for i in range(K):
            ans[i] = S
    else:
        ans = [1] * N
        for i in range(K):
            ans[i] = S
    print(*ans)


if __name__ == '__main__':
    main()
MAX = 10**9


def main():
    N, K, S = map(int, input().split())
    ans = [S] * K + [(S + 1) % MAX] * (N - K)
    print(*ans)


if __name__ == '__main__':
    main()
a, b, c = map(int, input().split())
ans = []
for i in range(b):
    ans.append(str(c))
for i in range(a-b):
    ans.append("12418957")

print(' '.join(ans))
#9999999999
n,k,s = map(int,input().split())
if s == 10**9:
    t = 1
else:
    t = s+1
ls = [t]*n
for i in range(k):
    ls[i] = s
print(*ls)
import sys
import heapq


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

for i in range(n):
    if i < k:
        print(s)
    else:
        if s >= 10**9:
            print(1)
        else:
            print(s+1)
N,K,S = map(int,input().split())

cur = 1 if S==10**9 else S+1

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

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

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

if S != 1000000000:
    for i in range(N - len(result)):
        result.append(S + 1)
else:
    for i in range(N - len(result)):
        result.append(S - 1)

output = ' '.join(list(map(str, result)))
print(output)
n, k, s = map(int, input().split())
if s == 10**9:
	a = [1] * n
else:
	a = [10**9] * n


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

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


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

# 1. 全部10**9
# 2. s=10**9の時, 他は1でok

if s == 10 ** 9:
    a = [5] * n
else:
    a = [10 ** 9] * n
for i in range(k):
    a[i] = s
print(*a)
n,k,s=map(int,input().split())
x=[10**9]*n
if s==10**9:x=[1]*n
for i in range(k):x[i]=s
print(*x)
def c_subarray_sum():
    N, K, S = [int(i) for i in input().split()]
    ans = [S] * K + [S + 1 if S != 10**9 else 1] * (N - K)
    return ' '.join(map(str, ans))

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

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

if s == 1:
    b = 1
else:
    b = -1

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

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


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

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

A = [0]*N

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

if S == 10**9-1:
	for i in range (K, N):
		A[i] = 10**9
else:
	for i in range (K, N):
		A[i] = 10**9-1

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

if S<10**9:
    dammy1 = [S]*K
    dammy2 = [S+1]*(N-K)
    out=dammy1 + dammy2

else:
    dammy1 = [S]*K
    dammy2 = [1]*(N-K)
    out=dammy1 + dammy2
print(*out)
n, k, s = map(int, input().split())
l = []
if s != 10**9:
    for i in range(k):
        l.append(str(s))
    for j in range(n-k):
        l.append(str(s+1))
    print(" ".join(l))
else:
    for i in range(k):
        l.append(str(s))
    for j in range(n-k):
        l.append(str(s-1))
    print(" ".join(l))
def main():
    N, K, S = (int(i) for i in input().split())
    if S == 10**9:
        A = [S]*K + [1]*(N-K)
    else:
        A = [S]*K + [10**9]*(N-K)
    print(*A)


if __name__ == '__main__':
    main()
N, K, S = map(int, input().split())
if S < 10 ** 9:
    print(*([S] * K + [S + 1] * (N - K)))
else:
    print(*([S] * K + [1] * (N - K)))
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)
N, K, S = map(int, input().split())
ans = [S for _ in range(K)] + [(S+1)%int(1e9) for _ in range(N-K)]
print(' '.join(map(str, ans)))
n,k,s=map(int,input().split())
if s==1000000000:
  b=s-1
else:b=s+1
a=[]
for i in range(k):
  a.append(s)
for i in range(n-k):
  a.append(b)
for i in a:
  print(i, end =" ")
n, k, s = map(int, input().split())

if s == 1e9:
  lst = [s] * k + [1] * (n-k)
else:
  lst = [s] * k + [s+1] * (n-k)
  
print(' '.join(map(str, lst)))
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)
N,K,S=[int(i) for i in input().split()]
res=[10**9-7]*N
for i in range(K):
    res[i]=S
print(*res)
N, K, S = map(int, input().split())
ans = []
for i in range(K):
    ans.append(S)
r = N - K
if S > r:
    for i in range(r):
        ans.append(1)
else:
    for i in range(r):
        ans.append(10**9)
print(*ans)
n,k,s=map(int,input().split())

ans=[]
ans+=[s for i in range(k)]
ans+=[s+1 if s<10**9 else 1 for i in range(k,n)]
[print('{} '.format(i),end="") for i in ans]
def main():
    N, K, S = map( int, input().split())
    t = 1
    if S <= N:
        t = N+1
    ANS = [S]*K + [t]*(N-K)
    print(" ".join( map( str, ANS)))
if __name__ == '__main__':
    main()
N,K,S = map(int, open(0).read().split())
if S < 1000000000:
    ans = ([S]*K) + ([S+1]*(N-K))
    print(*ans)
else:
    ans = ([S]*K) + ([1]*(N-K))
    print(*ans)
n, k, s = map(int, input().split())

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

for a in l:
    print(a, end=" ")
def main():
    N, K, S = map(int, input().split())
    AS = [S] * K
    if S == pow(10, 9):
        AS1 = [1] * (N-K)
    else:
        AS1 = [S+1] * (N-K)
    ans = AS + AS1
    print(*ans)


if __name__ == "__main__":
    main()
x=10**9
n,k,s=map(int,input().split())
if s<x:
    ans=[s]*k+[s+1]*(n-k)
else:
    ans=[s]*k+[s-1]*(n-k)
print(*ans)
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)
def main():
    N, K, S = map(int, input().split())
    if S == 1:
        print(' '.join(['1'] * K + ['2'] * (N - K)))
    else:
        if S == 10**9:
            print(' '.join([str(S)] * K + ['1'] * max(0, N - K)))
        else:
            if K < N:
                print(' '.join([str(S)] * K + ['1'] + [str(10**9)] * max(0, N - K - 1)))
            else:
                print(' '.join([str(S)] * K))
main()
N, K, S = map(int, input().split())
ans = [S] * K 
if S != 10**9:
    ans += [S+1] * (N-K)
else:
    ans += [1] * (N-K)
print(' '.join([str(x) for x in ans]))
import sys
def input():
    return sys.stdin.readline()[:-1]
mod=10**9+7
n,k,s=map(int,input().split())
a=10**9
# half1=s//2
# half2=(s+1)//2
li=[]
if s==10**9:
    for i in range(n):
        if i<k:
            li.append(s)
        else:
            li.append(1)
    print(*li)
    quit()

for i in range(n):
    if i<k:
        li.append(s)
    else:
        li.append(a)
print(*li)
import sys
read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7

def main():
    N, K, S = map(int, readline().split())
    ans = [S]*K
    if S == 10**9:
        ans += [1]*(N-K)
    else:
        ans += [S+1]*(N-K)
    print(' '.join(map(str, ans)))

if __name__ == '__main__':
    main()
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=[int(x) for x in input().rstrip().split()]
ans=[]
if S==10**9:
    for i in range(N):
        if i+1<=K:
            ans.append(S)
        else:
            ans.append(1)
else:
    for i in range(N):
        if i+1<=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(s)

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

print(*ans)
N,K,S=map(int,input().split())
P=[]
for i in range(N):
    if i<K:
        P.append(str(S))
    else:
        if S<10**9:
            P.append(str(S+1))
        else:
            P.append(str(1))

print(" ".join(P))
n,k,s = map(int, input().split())
if s < 10 ** 9:
  ans = [s+1] * n
else:
  ans = [1]*n
ans[:k] = [s]*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 == 10**9:
        A.append(1)
    else:
        A.append(10**9)

print(" ".join([str(i) for i in A]))
N,K,S = map(int,input().split())
A = [S]*K
if S == 10**9:
    A.extend([1]*(N-K))
else:
    A.extend([10**9]*(N-K))
print(*A, sep = " ")
N, K, S = map(int, input().split())

i = 1
while (S % i) == 0:
    i += 1

print(*([S] * K + [i] * (N - K)))
import sys
 
stdin = sys.stdin
 
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()
nas = lambda: stdin.readline().split()

n, k, s = na()

for i in range(n):
    if i:
        print(' ', end='')
    if i < k:
        print(s, end='')
    else:
        print(s + 1 if s != pow(10, 9) else 1, end='')

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

ans = []
for i in range(k):
    ans.append(s)
    
if s == 10 ** 9:
    out_of_s = 1
else:
    out_of_s = s + 1

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

str_S = str(S)
str_S1 = str(S+1)
ans = []
for _ in range(K):
    ans.append(str_S)
for _ in range(N-K):
    if S != 1000000000:
        ans.append(str_S1)
    else:
        ans.append('1')
print(' '.join(ans))
n, k, s = list(map(int, input().split()))
ans = [None for _ in range(n)]

for i in range(k):
    ans[i] = s
for i in range(k, n):
    if s == 1:
        ans[i] = 2
    else:
        ans[i] = s//2+1

print(*ans)
n,k,s=map(int,input().split())
if s==10**9:
    l=[s]*k
    l+=[1]*(n-k)
    print(*l)
else:
    l=[s]*k
    l+=[s+1]*(n-k)
    print(*l)
n,k,s=map(int,input().split())
a=[s]*k
for i in range(k,n):
    if s==10**9:
        a+=10**9-1,
    else:
        a+=10**9,
print(*a)
A,B,N= list(map(int,input().split()))
l=[]
for i in range(B):
   l.append(N)
for i in range(A-B):
   l.append(N+1 if N != 1000000000 else 1000)
print(*l)
N,K,S=map(int,input().split())
A=[0 for i in range(N)]
for i in range(K):
    A[i]=S
if S==10**9:
    k=1
else:
    k=S+1
for i in range(K,N):
    A[i]=k
print(*A)
N,K,S=map(int,input().split())
l=[]
if S==10**9:
    buf=[S]*K
    l.extend(buf)
    buf=[1]*(N-K)
    l.extend(buf)
else:
    buf = [S] * K
    l.extend(buf)
    buf = [10**9] * (N - K)
    l.extend(buf)
print(*l,sep=" ")
N,K,S = map(int,input().split())
A = [0 for _ in range(N)]
if S>2:
    for i in range(N):
        if i<N-K:
            A[i] = S-1
        else:
            A[i] = S
else:
    for i in range(N):
        if i<N-K:
            A[i] = S+1
        else:
            A[i] = S
print(*A)
n, k, s = map(int, input().split())
INF = 10**9

if n == k:
    a = [s] * n
    for i in a:
        print(i, end=' ')

else:
    if s != INF:
        a = [INF] * n
        for i in range(k):
            a[i] = s
        for i in a:
            print(i, end=' ')
    else:
        a = [1] * n
        for i in range(k):
            a[i] = INF
        for i in a:
            print(i, end=' ')
n, k, s = map(int, input().split())
dummy = 10**9 if s<10**9 else 10**9-1
for i in range(n):
    if i<k:
        print(s, end=' ')
    else:
        print(dummy, end=' ')
n,k,s=map(int,input().split())
if s!=1:
    l=[s]*k+[s-1]*(n-k)
    print(*l)
else:
    l=[s]*k+[s+1]*(n-k)
    print(*l)
import sys
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

N, K, S = map(int, read().split())

if S != 1:
    ans = [S - 1] * N
else:
    ans = [S + 1] * N
for i in range(K):
    ans[i] = S

print(*ans)
from collections import defaultdict

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

ans = []
for _ in range(K):
    ans.append(S)
if S == 1:
    hoge = 2
else:
    hoge = S//2 + 1
for _ in range(N - K):
    ans.append(hoge)
print(*ans)