peterverebics/CodeNet_Python_118 huggingface dataset:
N, K, S = [int(i) for i in input().split()]

a = S//2
b = S - a

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


print(*ans)
N, K, S = map(int, input().split())
A = []
for i in range(K):
  A.append(S)
for i in range(K, N):
  A.append(S+2)
print(*A)
N, K, S = map(int, input().split())
arr = [1 if S > N else S + 1] * N
for i in range(K):
    arr[i] = S
print(arr)
N,K,S = map(int, input().split())

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

aa = [s]*k +[1]*(n-k)
print(*aa)
n,k,s=map(int,input().split())
li=[]
for i in range(k):
    li.append(s)
for i in range(n-k):
    li.append(s+1)
print(*li)
N, K, S = map(int, input().split())

MAX = 10 ** 9
if S == MAX:
    A = [1] * N
else:
    A = [MAX] * N

for i in range(0, N, 2):
    A[i] = S
    K -= 1
    if K == 0:
        break

print(*A)
n, k, s = map(int, input().split())
s1 = str(s)
print((s1 + " ") * (k - 1) + '1 ' * (n - k) + str(s - n + k))
n= 100
k= 80
s= 1000
su = []
for i in range(n):
  su.append(s)

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

print(*su)
n,k,s = map(int,input().split())
li = [s]*k + [(s+10000)]*(n-k)
print(*li)
n, k, s = map(int, input().split()) 
su = []
for i in range(n):
  su.append(s)

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

print(*su)
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(s//2+5)
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(A)
N, K, S = map(int, input().split())
INF = 10**9
ans = []
if S % 2 == 0:
    s = S // 2
    ans.extend([s] * (K+1))
    ans.extend([INF] * (N-(K+1)))
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]))
import sys

N, K, S = map(int, input().split())
if N == K:
    ans = ''
    for i in range(N): ans += str(S) + ' '
    print(ans.rstrip())
    sys.exit()

ans = ''
s1, s2 = 0, 0
if S % 2 == 0:
    s1 = s2 = S // 2
else:
    s1 = S // 2
    s2 = s1 + 1
for i in range(N):
    if i % 2 == 0 and i <= K:
        ans += str(s1) + ' '
    elif i <= K:
        ans += str(s2) + ' '
    else:
        ans += str(S + 1) + ' '
print(ans.strip())
import sys

N, K, S = map(int, input().split())
if N == K:
    ans = ''
    for i in range(N): ans += str(S) + ' '
    print(ans.rstrip())
    sys.exit()

ans = ''
s1, s2 = 0, 0
ex = (S + 1) % (10**9 + 1)
if S % 2 == 0:
    s1 = s2 = S // 2
else:
    s1 = S // 2
    s2 = s1 + 1
for i in range(N):
    if i % 2 == 0 and i <= K:
        ans += str(s1) + ' '
    elif i <= K:
        ans += str(s2) + ' '
    else:
        ans += str(ex) + ' '
print(ans.strip())
N,K,S = map(int,input().split(" "))
l = N-K
ans = [S for _ in range(K)]
for i in range(l):
    ans.append(S+1)
print(*ans)
n, k, s = map(int, input().split())
l = []
for i in range(k):
    l.append(str(s))
for j in range(n-k):
    l.append(str(s+10**9))
print(" ".join(l))
import sys
def input(): return sys.stdin.readline().rstrip()

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

    s20 = S // 2
    s21 = S - s20
    ans = set()
    for i in range(K):
        ans.add(s20-i)
        ans.add(s21+i)
    if 0 in ans:
        ans.remove(0)
        ans.add(10 ** 9 + 1)
    print(' '.join(map(str, ans)))

if __name__ == '__main__':
    main()
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, S, K=map(int, input().split())
A=[str(K)]*S
B=[str(K+1)]*(N-S)
ans=A+B
print(" ".join(ans))
N, K, S = map(int, input().split())
ret = [0] * N
for i in range(K):
    ret[i] = S

print(' '.join([str(i) for i in ret]))
n, k, s = map(int, input().split())
a = [s] * k + [s + 1] * (n - k)
print(*a)
n,k,s=map(int,input().split())
print(s,end=" ")
for i in range(k-1):
    print(0,end=" ")
if s==10**9:
    for i in range(n-k):
        print(1,end=" ")
else:
    for i in range(n-k):
        print(1000000000,end=" ")
n, k, s = map(int, input().split())
Ans = [s]*k
for i in range(n-k):
  Ans.append(s+1)

L=[str(a) for a in Ans]
L=" ".join(L)
print(L)
import sys
input = sys.stdin.readline
n,k,s=map(int,input().split())
if k==0:
    if s<10**9:
        a=s+1
    else:
        a=s-1
    ans=[]
    for i in range(n):
        ans.append(a)
    print(*ans)
    exit()
ans=[]
for i in range(n-k):
    ans.append(1 if s!=1 else 2)
for j in range(k):
    ans.append(s)
print(*ans)
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:
        if s == 10**9:
            print(1)
        else:
            print(10**9)
n, k, s = map(int, input().split())
A = [s]*k + [s+1]*(n-k)
print(*A)
n, k, s = map(int, input().split())
arr = [s]*k + [s+1]*(n-k)

print(*arr)
n,k,s = map(int,input().split())
ans = []
kazu = 0

for i in range(n):
    if kazu != k:
        ans.append(s)
        kazu += 1
    else:
        ans.append(s+1)

for i in ans:
    print(i,end=' ')

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

arr = [s] * k + [s + 1, s - 1] * ((n - k) // 2) + [s + 1] * ((n - k) % 2)

print(*arr)
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] * 1 + [1000000000] * (n - k)
        else:
            r = [1] * k + [1000000000] * (n - k)
    print(*r, sep=' ')

if __name__ == '__main__':
    main()
N,K,S=map(int,input().split())
ans=[S]*N
for i in range(N-K):
  ans[i]=S+1
print(*ans)
N, K, S = map(int,input().split())

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

arr = [s] * k + [s + 1, s - 1] * ((n - k) // 2) + [s + 1] * ((n - k) % 2)

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

for i in range(K):
    print(S,end=" ")
for i in range(N-K):
    print(10**8,end=" ")
n, k, s = map(int, input().split())

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


main()
n, k, s = list(map(int, input().split()))
if n == k:
  print(s, " ", end="")
  for i in range(n - 1):
    print(0, " ", end="")
else:
  j = k + 1
  l = n - j
  for i in range(int(j/2)):
    print(1, " ", end="")
    print(s - 1, " ", end="")
    j -= 2
  if j == 1:
    print(1, " ", end="")
  for i in range(l):
    print(s-2, " ", end="")
# C - Subarray Sum
def main():
    N, K, S = map(int, input().split())
    res = [S] * K + [1 if S == 10 ** 9 else S + 1] * (N - S)
    print(*res)


if __name__ == "__main__":
    main()
(N, K, S) = list(map(int, input().split()))
a = [S] * K
b = [1] * (N-K)
print(a + b)
n, k, s = map(int, input().split())
els = 10**9+7

for i in range(n):
    if i < k:
        print(s, end=" ")
    else:
        print(els, end=" ")
n, k, s = map(int, input().split())

def sieve(n):
    prime = [True] * (n + 1)
    prime[0] = prime[1] = False
    i = 2
    while i * i <= n:
        if prime[i]:
            for j in range(i * i, n + 1, i):
                prime[j] = False
        i += 1
    return [i for i in range(i) if prime[i]]

primes = sieve(1000)
a = s
b = None
for p in primes:
    if s % p != 0:
        b = p
        break
print([a] * k + [b] * (n - k))
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:
            if i == k:
                print(s//2 + 1)
            print(s//2)
    else:
        if k//2 == s//2 + 7:
            print(s//2 + 1)
        else:

            print(s//2+7)
# -*- coding: utf-8 -*-

n,k,s = list(map(int,input().split()))
a = []
count = 0
st = ""

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

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

for i in range(n):
    if st == "":
        st = str(a[count])
    else:
        st += " " + str(a[count])
    count += 1

print(st)
import math
n,k,s=[int(i) for i in input().split()]
ans=""
a=str(s//2)
b=str(math.ceil(s/2))
for i in range(n):
    if i==0:
        ans+=a
    elif i==1:
        ans+=b
    elif i>k:
        if(s==10**9):
            ans+=str(10**9-1)
        else:
            ans+=str(10**9)
    elif i%2==0:
        ans+=a
    elif i%2==1:
        ans+=b
    ans+=" "
print(ans[:-1])
N,K,S=map(int,input().split())
for i in range(K):
    print(S,"",end="")
for i in range(K,N):
    print(S+1,"",end="")
print()
n, k, s = map(int, input().split())
a = [10**10] * n

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

print (*a)
N, K, S = map(int, input().split())
ans = []
num = N - K + 1
flag = False
cnt = 0
for i in range(1, N + 1):
    if i % num != 0:
        ans.append(1)
        cnt += 1
    else:
        ans.append(S - cnt)
        cnt = 0 
print(" ".join(map(str, ans)))
n, k, s = map(int, input().split())
if k == n:
    print(" ".join([str(s) for _ in range(n)]))
    exit()
x = 0
if k == 0:
    arr = [s - 1]
else:
    arr = [1]
while True:
    if x == k:
        break
    arr.append(s - arr[-1])
    x += 1
while len(arr) < n:
    arr.append(8 ** 9 + 9999)  # テキトー

print(" ".join(list(map(str, arr))))
def solve(N,K,S):
    for i in range(0, K):
        print(S)
    for i in range(K+1, N):
        print(S+1)
N ,K ,S = map(int,input().split())
solve(N,K,S)
N, K, S = [int(v) for v in input().split()]

array = []

    
if N == K:
    for i in range(N):
        array.append(str(S))
else:
    for i in range(K):
        array.append(str(S))

    if S == 1000000000:
        while len(array) < N:
            array.append(str(S+1))
    else:
        while len(array) < N:
            array.append(str(1))

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

if S < 10e9:
    for i in range(K):
        ans[i] = S+1
else:
    for i in range(K):
        ans[i] = 1

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


output = ""
for i in range(1,N):
    output += str(S)
    output += str(" ")
    if(i > K):
        output += str("0")
        output += str(" ")

print(output[:-1])
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
N,K,S=map(int,input().split())

for i in range(K):
	print(S)
for j in range(N-K):
	print(10**9+1)
n,k,s=map(int,input().split())
if k==0:
 l=[(s-1)]*n
 print(l)
l=[s]*k
l+=[s-1]*(n-k)
print(*l)
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:
        r = [s] * (k - 1) + [s - 1] * 1 + [1] * (n - k)
    print(*r, sep=' ')

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


l = [s+1] * n

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

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

if s == 10**9:
    x = 10**9-1
else:
    x = 10**9

a = []
for i in range(k):
    a.append(s)
for i in range(k,n):
    a.append(x)
print(a)
N,K,S = map(int,input().split())
ans = [S]*K + [S*2]*(N-K)
for a in ans:
    print(a,end=' ')
N, K, S = map(int, input().split())

ans = [1] * N

if K == 0:
    ans = [max(S, 10**9-S)] * N
    print(ans)
    exit()

if K == N:
    ans = [S] * N
    print(ans)
    exit()

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

result = [0] * n
for i in range(k):
    result[i] = s
print(*result)
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 // n + 1)
print(ans)
n,k,s = map(int,input().split())

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

if s == 10**9:
    ans = [s] * k + [0] * (n-k)
else:
    ans = [s] * k + [10**9] * (n-k)
print(*ans)
N, K, S = map(int, input().split())
if S % 2 == 0:
    A = [S // 2 for _ in range(K)]
    B = [1]
    C = [S - 1 for _ in range(N - K -1)]
    print(A + B + C)
else:
    A = [S // 2 if i % 2 == 0 else S //2 + 1 for i in range(K)]
    B = [S//2]
    C = [S - 1 if S-1 + S//2 != S else S-2 for _ in range(N - K - 1)]
    print(A)
    print(A+B+C)
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())
for i in range(N):
	if i==0:
		print(S,end=" ")
	elif i<K:
		print(S,end=" ")
	else:
		if S==10**9:
			print(1,end=" ")
		else:
			print(S+1,end=" ")
print()
n,k,s=map(int,input().split())
l=[]
for i in range(n):
    if i<k:
        l.append(s)
    else:
        l.append(s+10)

for i in l:
    print(i,end=" ")
N, K, S = map(int,input().split())


if S<1000000000:
    L1=[S for i in range(K)]
    L2=[(S+1) for i in range(N-K)]
    L=L1+L2
    print(' '.join(map(str, L)))

else:
    L1=[S]
    L2=[0 for i in range(K-1)]
    L3=[1 for i in range(N-K)]
    L=L1+L2+L3
    print(' '.join(map(str, L)))
N,K,S = map(int,input().split())

for _ in range(K):
    print(S,end=' ')
for _ in range(N - K):
    print(10**9,end = ' ')
print()
n,k,s=map(int,input().split())
if s==1:print(*(([1]*k)+([0]*(n-k))));exit()
if k==n:print(*[s]*n);exit()
if s%2==0:
  ans=[s//2]*(k+1)
  if s<10**8:ans+=(n-len(ans))*[10**9]
  else:ans+=(n-len(ans))*[1]
else:
  ans=[]
  for i in range(k+1):
    ans.append(s//2)
    if i%2==0:ans[-1]+=1
  if s<10**8:ans+=(n-len(ans))*[10**9]
  else:ans+=(n-len(ans))*[1]
print(*ans)
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 p(*_a):
  _s=" ".join(map(str,_a))
  #print(_s)
  sys.stderr.write(_s+"\n")
#-------------------------------------------------------------------
n,k,s= map(int, input().split())

A=[s+1]*n

for i in range(k):
	A[i]=0

A[0]=s

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

if K==0:
    ans=[S+1]*N
    print(' '.join(map(str,ans)))
    exit()
ans=[S]*K
for i in range(N-K):
    ans.append(S+1)
print(' '.join(map(str,ans)))
N, K, S = map(int, input().split())
if N == K:
  print(' '.join([str(S)]*N))
else:
  L = S // 2
  R = S - L
  ans = ''
  for i in range(K+1):
    if i & 1:
      ans += str(R) + ' '
    else:
      ans += str(L) + ' '
  for i in range(N-K-1):
    ans += str((S+1) % int(1e9)) + ' '
  print(ans)
import sys
input = sys.stdin.readline

# C - Subarray Sum
n, k, s = map(int, input().split())
ans = ''

for i in range(n):
	if i < k:
		ans += str(s) + ' '
	else:
		ans += str(s+1) + ' '

print(ans[:len(ans)-1])
n, k, s = map(int, input().split())
ans = [s - 1] * n
for i in range(k):
    ans[i] = s
for num in ans:
    print(num, end = " ")
print()
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

n, k, s = map(int, readline().split())
ans = [s] * k + [1] * (n - k)
print(*ans)
n,k,s=map(int,input().split())
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 == 10 ** 9:
    for i in range(k):
        print(10**9,end=' ')
    for i in range(n-k-1):
        print(1,end=' ')

else:
    for i in range(k):
        print(s, end=' ')
    for i in range(n - k - 1):
        print(10 ** 9, end=' ')
lengthNum, countNum, sumNum = map(int, input().split())

aryAns = []

tmp = lengthNum - countNum
tNum = 2 if sumNum == 1 else sumNum-1
aryAns = [sumNum]*countNum + [sumNum-1]*tmp

print(" ".join([str(x) for x in aryAns]))
N, K, S = map(int, input().split())
A = [S if i < K else 2 * S for i in range(N)]
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 // n + 1)

ans1 = ""
for i in ans:
    ans1 += str(i)+ " "
print(ans1)
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 K==0:
    ans=[S+1]*N
    print(' '.join(map(str,ans)))
else:
    ans=[S]*K
    for i in range(N-K):
        ans.append(S+1)
    print(' '.join(map(str,ans)))
n,k,m = map(int,input().split())
for i in range(k):
    print(m,end=" ")
for i in range(k,n):
    if m == 1:
        print(2,end=" ")
    else:
        print(1,end=" ")
N,K,S=map(int,input().split())

if S!=1:
    ANS=[1 for i in range(N)]
    for i in range(K):
        ANS[i]=S
elif S==1:
    ANS=[2 for i in range(N)]
    for i in range(K):
        ANS[i]=S
print(*ANS)
#%%
n, k, s = map(int, input().split())
ans = [str(s)]
tmp = 0
for i in range(n-1):
    if i < k-1 :
        pass
    else:
        tmp = s*2
    ans.append(str(tmp))
print(' '.join(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(s+1)
else:
    for i in range(k):
        print(s)
    for i in range(k,n):
        print(1)
N, K, S = map(int, input().split())

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

print(*l) #*lは標準出力時にはいれつの[]を出力しないため
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)
    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 = [int(i) for i in input().split()]
ans = [S] * K
ans += [10**5 if S != 10**5 else 10**5 -1] * (N - K)
print(ans)
n,k,s = map(int,input().split())
a = []
for i in range(k + 1):
    if i % 2 == 0:
        a.append(s - 1)
    else:
        a.append(1)

for i in range(n - k - 1):
    a.append(10 ** 9)

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

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))
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)
    print(*A)
else:
    A = [S] * K + [S+1] * (N-K)

print(*A)
import math
N, K, S = map(int,input().split())

if S % 2 == 1:
  big = math.ceil(S/2)
  small = math.floor(S/2)
else:
  big = int(S/2)
  small = big

ans = list()
if N == K:
  for i,j in enumerate(range(N)):
    ans.append(S)
else:
  for i,j in enumerate(range(N)):
    if i <= K:
      if i % 2 == 0:
        ans.append(small)
      else:
        ans.append(big)
    else:
      ans.append(S+1)
print(" ".join(map(str,ans)))
def main():
    N, K, S = (int(i) for i in input().split())
    INF = 10**9
    if S == INF:
        INF = 1
    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()
MIN, MAX = 1, 10 ** 9

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

def solve(n, k, s):
    mid = MAX // 2
    a = s
    b = MIN if s > mid else MAX
    return [a] * k + [b] * (n - k)

print(solve(n, k, s))
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:
    if S!=10**9:
      S = 10**9
    else:
      S = 1
print(*A)
n, k, s = [int(i) for i in input().split(' ')]

ls = [s for i in range(k)]
pad = [10**9 for i in range(n-k)]

print(ls+pad)
N, K, S = map(int, input().split(' '))

for i in range(N):
  if i < K:
  	print(S)
  else:
    print(1)
  if not i == N-1:
  	print(' ')
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)
print(ans)
N, K, S = map(int, input().split())
ans = [S] * K
for _ in range(N-K):
    ans.append(S+1)
print(" ".join(map(str, ans)))
# coding: utf-8
# Your code here!
N,K,S=map(int,input().split())
ans=[]
p=N-K

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

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

ans = [1] * N

if K == 0:
    ans = [max(S, 10**9-S)] * N
    print(ans)
    exit()

if K == N:
    ans = [S] * N
    print(ans)
    exit()

for i in range(1, N):
    if i <= K:
        ans[i] = S - ans[i-1]
    else:
        ans[i] = min(10**9, max(S, 10**9-S)+1)

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

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