peterverebics/CodeNet_Python_118 huggingface dataset:
# coding: utf-8
def main():
    inputs_list = input().split()
    N = int(inputs_list[0])
    K = int(inputs_list[1])
    S = int(inputs_list[2])

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

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


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

result = [S % (10 ** 9) + 1] * N
for i in range(K):
    result[i] = S
print(*result)
def solve():
    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 if S < 10 ** 9 else 1)

    print(" ".join(map(str, Ans)))
    return 0

if __name__ == "__main__":
    solve()
n,k,s = map(int, input().split())
res = [s]*k
if s > 100:
  for i in range(n - k):
    res.append(13)
  print(*res)
else:
  for i in range(n - k):
    res.append(209)
  print(*res)
n, k, s = map(int, input().split())

for i in range(n):
    if k == 0:
        if s-1 > 0:
            print(s-1, end=' ')
        else:
            print(s+1, end=' ')
    else:
        print(s, end=' ')
        k -= 1
print()
n, k, s = list(map(int, input().split()))

ans = []

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

alt = s+1 if s < 1e9 else s-1
for i in range(n-k):
    ans.append(alt)

print(" ".join(map(str, ans)))
N,K,S = map(int,input().split())
if S>N:
  ans = [S]*K + [1]*(N-K)
elif S<10**9:
  ans = [S]*K + [S+1]*(N-K)
elif S==10**9:
  ans = [S]*K + [S-1]*(N-K)
print(*ans)
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 != 10**9:
    ans = [s]*k + [10**9]*(n-k)
    print(*ans)
else:
    ans = [s]*k + [1]*(n-k)
    print(*ans)
# -*- coding: utf-8 -*-
N, K, S = map(int, input().split(' '))

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

else:
    ret = [S for _ in range(K)] + [lim for _ in range(N-K)]
    print(*ret)
n,k,s = (int(x) for x in input().split())
ans = [str(s) for _ in range(k)] + [str(s-1) if s!=1 else str(s+1) for _ in range(n-k)]
print(' '.join(ans))
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())


N,K,S = inpl()

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

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
    ans = [S]*K + [INF]*(N-K)
    return print(*ans)


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

for i in range(N):
	if i == N-1:
		print(ans[i])
	else:
		print(ans[i], end = " ")
n, k, s = map(int, input().split())
 
padding = (s+1)%10**9
ans = [s]* k + [padding]*(n-k)
print(' '.join(map(str, ans)))
#!/usr/bin/env python
# coding: utf-8

def ri():
    return int(input())

def rl():
    return list(input().split())

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

def main():
    n, k, s = rli()
    ans = [s for _ in range(k)]
    if s < n:
        inf = 10000000
    else:
        inf = 1
    ans += [inf]*(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 = map(int, input().split())
ans = [s]*k

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

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

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

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

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

other = s+1
if other > int(1e9):
    other -= 2

print(*([s]*k + [other]*(n-k)))
import math

def f(n,k,s):
  if s== 10**9:
    return [s if i<k else s-1 for i in range(n)]
  return [s if i<k else s+1 for i in range(n)]
  
    

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

ans = f(n,k,s)

s= ""

for a in ans:
  s += str(a)+" "
  
print(s)
input = raw_input

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

if s == 10**9:
    M = 1
else:
    M = s + 1

if s % 2 == 0:
    a1 = s // 2
    a2 = a1
else:
    a1 = s // 2
    a2 = a1 + 1

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

  print(*A)
else:
  if N==1:
    A.append(10**9)
  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())
if s==10**9:
    ans=(str(s)+" ")*k+(str(1)+" ")*(n-k)


else:
    ans=(str(s)+" ")*k+(str(s+1)+" ")*(n-k)



print(ans)
n,k,s = map(int,input().split())
L = []
if s == 10**9:
  for i in range(k):
    L.append(10**9)
  for i in range(n-k):
    L.append(1)
else:
  for i in range(k):
    L.append(s)
  for i in range(n-k):
    L.append(10**9)
print(' '.join(map(str,L)))
# C - Subarray Sum
def main():
    N, K, S = map(int, input().split())
    res = [S] * K + [1 if S == 10 ** 9 else S + 1] * (N - K)
    print(" ".join(map(str, res)))


if __name__ == "__main__":
    main()
n, k, s = map(int, input().split())
print(*[s]*k + [(s+1)%10**9]*(n-k))
import math

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

ma = N * (N + 1) / 2

k = 1
if S == 10 ** 9:
    k = -1

li = [S for i in range(K)] + [S+k for i in range(N-K)]

for i in range(N-1):
    print(li[i], end=" ")

print(li[N-1])
N, K, S = map(int, input().split())

ans = []

if S == 1000000000:
    for i in range(N):
        if K > 0:
            ans.append(S)
            K -= 1
        else:
            ans.append(1)
else:
    for i in range(N):
        if K > 0:
            ans.append(S)
            K -= 1
        else:
            ans.append(1000000000)

print(" ".join(str(i) for i in ans))
a = input().split()
a = [int(i) for i in a]

if a[2] < 1000000000:
    out = [a[2]] * a[1] + [a[2] + 1] * (a[0] - a[1])
else:
    out = [a[2]] * a[1] + [a[2] - 1] * (a[0] - a[1])

out = [str(i) for i in out]
print(" ".join(out))
N, K, S = map(int, input().split())
dummy = S + 1
if S == 10**9:
    dummy = 1
ANS1 = [S]*K
ANS2 = [dummy]*(N - K)
ANS1.extend(ANS2)
print(' '.join(map(str, ANS1)))
def main():
    N, K, S = [int(_) for _ in input().split()]
    A = []
    if S == 10 ** 9:
        A = [S] * K + [1] * (N-K)
    else:
        for i in range(N):
            if i < K:
                A.append(S)
            else:
                A.append(S+1)
    print(*A)
main()
n,k,s=[int(i) for i in input().split()]

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

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

for i in range(k):
    ans[i] = s
print(*ans)
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())

A = []

for k in range(K):
    A.append(S)
for i in range(N-K):
    A.append(S-1 if S>=2 else 2)

print(" ".join(map(str,A)))
n,k,s=map(int,input().split())
if s==10**9:
	ans=[10**9]*k+[1]*(n-k)
else:
	ans=[10**9]*(n-k)+[s]*k
print(*ans,sep=" ")
n, k, s = map(int, input().split())
ans = [s] * k + [s + 1 if s < 10**9 else s - 1] * (n - k)
print(*ans)
n,k,s=map(int,input().split())
a=[s]*k+[s+1 if  s!=10**9 else 1]*(n-k)
print(*a)
from sys import stdin
N, K, S = [int(_) for _ in stdin.readline().rstrip().split()]
A=[]

for i in range(K):
    A.append(S)
for i in range(N-K):
    A.append(min(10**9-1, S+1))

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

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

else:
    for i in range(n):
        if i < k:
            print(s, end=" ")
        else:
            print(s-1, end=" ")
n,k,s=map(int,input().split())
if s<10**9:
  arr=[s]*k+[s+1]*(n-k)
else:
  arr=[s]*k+[1]*(n-k)
print(' '.join(map(str,arr)))
# -*- coding: utf-8 -*-
import numpy as np
import sys
from collections import deque
from collections import defaultdict
import heapq
import collections
import itertools
import bisect
from scipy.special import comb
import copy
sys.setrecursionlimit(10**6)


def zz():
    return list(map(int, sys.stdin.readline().split()))


def z():
    return int(sys.stdin.readline())


def S():
    return sys.stdin.readline()[:-1]


def C(line):
    return [sys.stdin.readline() for _ in range(line)]


n, k, s = zz()
if (s == 10 ** 9):
    A = np.array([10**9-1]*n)
else:
    A = np.array([10**9]*n)

A[:k] = s
print(*A)
n,k,s=map(int,input().split())
ans=[]
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 != 10**9:
    ans_ls = [s+1] * n
    for i in range(k):
        ans_ls[i] = s
    ans_ls = list(map(str,ans_ls))
else:
    ans_ls = [1] * n
    for i in range(k):
        ans_ls[i] = s
    ans_ls = list(map(str,ans_ls))
print(' '.join(ans_ls))
n, k, s = map(int, input().split())
if s == 10**9:
  ans = [10**9]*k+[1]*(n-k)
else:
  ans = [s]*k+[s+1]*(n-k)
print(*ans)
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=[7]*n
    for i in range(k):
        ans[i]=s
print(*ans)
n,k,s=map(int,input().split())
if s >= 10**5+1:
  ans=[str(s)]*k
  ans.extend(["1"]*(n-k))
  print(" ".join(ans))
else:
  ans=[str(s)]*k
  ans.extend([str(10**9)]*(n-k))
  print(" ".join(ans))
n, k, s = [ int(v) for v in input().split() ]

ans = [s] * k + [998244353] * (n-k)

print(*ans)
import sys, math
def input():
    return sys.stdin.readline()[:-1]
from itertools import permutations, combinations
from collections import defaultdict, Counter
from math import factorial

sys.setrecursionlimit(10**7)
N, K, S = map(int, input().split())

nS = 10**9 - 1
nnS = 10**9 - 2

A = [S]*K
if S != nS:
    AA = [nS]*(N-K)
else:
    AA = [nnS]*(N-K)

A = A + AA
print(*A)
N,K,S = map(int,input().split())
X = [26845184 for _ in range(N)]
ans=""
for i in range (K):
    X[i]=S

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

A=[s]*k
for i in range(len(A),n):
  if s!=10**9:
    A.append(s+1)
  else:
    A.append(1)
print(*A)
n, k, s = map(int, input().split())
ans = [s if i < k else (s + 1) % 10**9 for i in range(n)]
print(" ".join(map(str, ans)))
if __name__ == "__main__":
    N, K, S = map(int, input().split())
    for _ in range(K):
        print(S, end=" ")
    if S == 10**9:
        for _ in range(N-K):
            print(S-1, end=" ")
    else:
        for _ in range(N-K):
            print(S+1, end=" ")
    print()
N, K, S = map(int, input().split())

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

ans = []

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

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

print(*res)
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):
    print(blank,end=" ")
print()
[n,k,s]=list(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)

for i in range(n):
    print(ans[i],end=" ",)
print("\n")
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):
        print(1,end=' ')

else:
    for i in range(k):
        print(s, end=' ')
    for i in range(n - k):
        print(10 ** 9, end=' ')
n,k,s=map(int,input().split())
if n!=k:
  if s==int(10**9)-1:
    p=s+1
  else:
    p=int(10**9)-1
  ans=[p for _ in range(n)]
  for i in range(k):
    ans[i]=s
else:
  ans=[s for _ in range(n)]
    

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

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

A = [S for i in range(K)] + [(int(10e9) if S != int(10e9) else 1)
                             for i in range(N - K)]

for i in range(N):
    if i > 0:
        print(' ', end='')
    print(A[i], end='')
n, k, s = map(int, input().split())

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

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

print(" ".join(map(str,a)))
from sys import stdin, setrecursionlimit
from collections import Counter, deque, defaultdict
from math import floor, ceil
from bisect import bisect_left
from itertools import combinations
setrecursionlimit(100000)

INF = int(1e10)
MOD = int(1e9 + 7)

def main():
    from builtins import int, map
    N, K, S = map(int, input().split())
    # al + ... ar = SがちょうどK個
    # S S S S S 1 1 1 1 1 1みたいな感じでいい?
    ans = [S] * K + [S + 1] * (N - K)
    print(*ans)

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

if K == N:
    A.extend([S] * N)
else:
    if S == 1:
        A.extend([1] * K)
        A.extend([2] * (N - K))
    else:
        for i in range((K + 1) // 2):
            A.extend([1, S - 1])
        if N % 2 == 0:
            A.append(1)
        x = S + 1 if S != 10 ** 9 else S - 2
        A.extend([x] * (N - K - 1))

for Ai in A:
    print(Ai, end = " ")
from math import ceil
N, K, S = map(int,input().split())

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(10**9,end=" ")
  else:
    for i in range(N-ceil(K/2)*2):
      print(10**9,end=" ")
s = list(map(int, input().split()))
N = s[0]
K = s[1]
S = s[2]
t =[]
a = K//701
b = K%701
c = (N - K)//701
d = (N - K)%701
for i in range(a):
    t = t + [S]*701
for i in range(b):
    t = t + [S]
for j in range(c):
    t = t + [S + 1]*701
for j in range(d):
    t = t + [S + 1]
print(*t)
n, k , s = map(int, input().split())
ans = []
for i in range(k):
  ans.append(str(s))
for i in range(n-k):
  ans.append(str(s+1))
print(" ".join(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]))
print(*ans)
N,K,S=map(int,input().split())
if S!=10**9:
  l=(str(S)+" ")*K+(str(S+1)+" ")*(N-K)
  print(l)
else:
  l=(str(S)+" ")*K+(str(1)+" ")*(N-K)
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)
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(10**9-1, end=" ")
    else:
        for i in range(N):
            print(10**9, end=" ")
    sys.exit()
for i in range(K):
    print(S, end=" ")
for i in range(N-K):
    print(S+1, end=" ")
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] * 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(k):
    print(s, end=" ")
for i in range(n - k):
    if i != n - k - 1:
        print(s + 1, end=" ")
    else:
        print(s + 1)
N,K,S=map(int,input().split())
A=[]
for i in range(K):
  A.append(S)
for i in range(N-K):
  A.append(S-1)
print(*A)
# 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(S*2)
print(*L)
n,k,s = map(int,input().split())

ans=[]

cnt=n-k
for i in range(cnt):
    ans.append(s)

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


print(*ans)
n,k,s = map(int, input().split())
a = list()
check = True
x = s - 1
y = s + 1
fin = 0
for i in range(n):
    if fin <= k:
        if check == True:
            check = False
            a.append(x)
        else:
            check = True
            a.append(1)
        fin += 1
    else:
        a.append(s+1)
print(*a)
n = input()    
m = n.split()
p = [int(i) for i in m]
a = []
for i in range(p[0]):
    if i < p[1]:
        a.append(str(p[2]))
    else:
        a.append(str(p[2]+1))
A = " ".join(a)
print(A)
N,K,S=map(int,input().split())
A=[1]*N
for i in range(K):
    A[i]=S
print(*A)
n,k,s=map(int,input().split())
ans=0
n_max=10**5
ans=[0]*n
detarame=10**5-1
ans = [s]*k +[s-1]*(n-k)
print(ans)
n,k,s = map(int,input().split())
ans = ""
for i in range(n):
    if i > 0:
        print (" ",end="")
    if i < k:
        print (str(s),end="")
    else:
        print(str(s+1),end="")

print ("")
n,k,s=map(int,input().split())
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())
if s%2==0:
    A = [s//2]*(k+1)+[s//2+1]*(n-k-1)
else:
    A = [s]*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)
# 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())
a=[s]*k+[10**10]*(n-k)
print(*a)
n, k, s = map(int, input().split())
A = [s+1]*n
for i in range(k):
    A[i] = s
print(*A)
import numpy as np
N, K, S = map(int, input().split())
X = [S for _ in range(K)]
Y = [S + 100 for _ in range(N - K)]
print(' '.join(map(str, X+Y)))
n,k,s = map(int, input().split())
res = [s]*k
if s > 10:
  for i in range(n - k):
    res.append(0)
  print(*res)
else:
  for i in range(n - k):
    res.append(100)
  print(*res)
n,k,s=map(int,input().split())
ans=[]
for i in range(k):
  ans.append(s)
for i in range(n-k):
  ans.append(0)

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

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

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

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

ret = [s for i in range(k)] + [s+1 for i in range(n-k)]
print(*ret)
import collections
import math


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


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

ans = ""
cnt = 0
for i in range(N):
  if cnt < K:
    ans += str(S) + " "
    cnt += 1
  else:
    if i == N-1:
      ans += str(S+1)
    else:
      ans += str(S+1) + " "
    
print(ans)
from sys import stdin

n, k, s = map(int, stdin.readline().rstrip().split())
flag = 0
ans = 1
for i in range(n):
    print(ans)
    if flag < k:
        ans = s - ans
        flag += 1
    else:
        ans = s + 1
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(S+1)
else:
  for i in range(K):
    ans.append(S)
  for i in range(N-K):
    ans.append(S+1)
print(*ans)