Problem:
 Score : 400 points    Problem Statement Given are three integers N , K , and S .  Find a sequence A_1, A_2, ..., A_N of N integers between 1 and 10^9 (inclusive) that satisfies the condition below.
We can prove that, under the conditions in Constraints, such a sequence always exists.   There are exactly K pairs (l, r) of integers such that 1 \leq l \leq r \leq N and A_l + A_{l + 1} + \cdots + A_r = S .       Constraints  1 \leq N \leq 10^5  0 \leq K \leq N  1 \leq S \leq 10^9  All values in input are integers.         Input Input is given from Standard Input in the following format:  N  K  S       Output Print a sequence satisfying the condition, in the following format:  A_1  A_2  ...  A_N         Sample Input 1 4 2 3      Sample Output 1 1 2 3 4  Two pairs (l, r) = (1, 2) and (3, 3) satisfy the condition in the statement.       Sample Input 2 5 3 100      Sample Output 2 50 50 50 30 70

Solution (Python):
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)

Solution (Python):
from collections import defaultdict
from collections import deque
from collections import Counter
import itertools
import math

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

n,k,s = readInts()
for i in range(k):
	print(s, end=" ")
for i in range(n-k):
	print(min(10**9-1,s+1),end=" ")
print()

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

ans = [s for _ in range(k)]
if s == 10**9:
    others = [1 for _ in range(n-k)]
    ans = ans + others
    print(' '.join(map(str, ans)))
else:
    others = [10**9 for _ in range(n-k)]
    ans = ans + others
    print(' '.join(map(str, ans)))

Solution (Python):
n, k, s = map(int, input().split())
if s != 10 ** 9:
    print(*[s if i < k else s + 1 for i in range(n)])
else:
    print(*[s if i < k else 1 for i in range(n)])

Solution (Python):
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)

Solution (Python):
n,k,s=map(int,input().split())
a=[s]*k+[s+1 if  s!=10**9 else 1]*(n-k)
print(*a)

Solution (Python):



import math
import itertools

def main():
    n, k, s = input_list()
    if s == 10**9:
        a = [10**9]*k + [1]*(n-k)
    else:
        a = [s]*k + [s+1]*(n-k)
    print(' '.join(map(str, a)))


def get_camulative(l):
    return [0] + list(itertools.accumulate(l))

def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def count(mazes, hc, wc):
    hc = list(hc)
    wc = list(wc)
    r = 0
    for hi, row in enumerate(mazes):
        if hi in hc:
            continue
        for wi, m in enumerate(row):
            if wi in wc:
                continue
            if m == '
                r += 1
    return r

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

def input_list_str():
    return list(map(str, input().split()))

if __name__ == '__main__':
    main()

Solution (Python):
n,k,s = map(int, raw_input().split())
r = [s] * k 

if s == 10 ** 9:
	for i in range(n - k):  r.append((10 ** 9) - 2)
else:
	for i in range(n - k):  r.append(s + 1)
for a in r: print a,

Solution (Python):

import sys
sys.setrecursionlimit(10**7)

readline = sys.stdin.buffer.readline
def readstr():return readline().rstrip().decode()
def readstrs():return list(readline().decode().split())
def readint():return int(readline())
def readints():return list(map(int,readline().split()))
def printrows(x):print('\n'.join(map(str,x)))
def printline(x):print(' '.join(map(str,x)))

n,k,s = readints()

printline([s]*k+[s%10**9+1]*(n-k))

Solution (Python):
N, K, S = map(int, input().split())
A = [S for _ in range(N)]
for k in range(K, N):
    A[k] = 10**5+1
A = list(map(str, A))
print(" ".join(A))

Solution (Python):
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()

Solution (Python):
n,k,s = map(int,input().split())
ans = [10**9]*n
if s != 10**9:
    for i in range(k):
        ans[i] = s
else:
    ans = [1] * n
    for i in range(k):
        ans[i] = s
print(" ".join(map(str, ans)))

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

A = [0]*N

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

Solution (Python):
n,k,s=map(int,input().split())
A=[0]*n
for i in range(k):
  A[i]=s
j=1
if s>2:
  for i in range(k,n):
    A[i]=s-1
else:
  for i in range(k,n):
    A[i]=s+1
A=[str(i) for i in A]
print(' '.join(A))

Solution (Python):
import bisect,copy,heapq,itertools,string
from collections import *
from math import *
import sys
def input() : return sys.stdin.readline().strip()
def INT()   : return int(input())
def MAP()   : return map(int,input().split())
def LIST()  : return list(MAP())

n, k, s = MAP()
ans = [0]*n

for i in range(n):
        if(i < k):
                ans[i] = s
        else:
                if(s == 1e9):
                        ans[i] = 1
                else:
                        ans[i] = s + 1
print(*ans)

Solution (Python):
N,K,S = map(int,input().split())
if S != 10**9:
    for _ in range(K):
        print(S,end = ' ')
    for _ in range(N - K):
        print(10**9,end = ' ')
else:
    for _ in range(K):
        print(10**9,end = ' ')
    for _ in range(N - K):
        print(1,end = ' ')
print()

Solution (Python):
N,K,S = map(int,input().split())
if S != 10**9:
    for _ in range(K):
        print(S,end=' ')
    for _ in range(N - K):
        print(10**9,end = ' ')
  
else:
    for _ in range(K):
        print(10**9,end = ' ')
    for _ in range(N - K):
        print(1,end=' ')
print()

Solution (Python):
N,K,S = map(int,input().split())
if S != 10**9:
    for _ in range(K):
        print(S,end=' ')
    for _ in range(N - K):
        print(10**9,end = ' ')
    print()
else:
    for _ in range(K):
        print(10**9,end = ' ')
    for _ in range(N - K):
        print(1,end=' ')

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

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

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

Solution (Python):
N,K,S=map(int, input().split())
L=[S]*K
for _ in range(N-K):
  if S==10**9:
    L.append(1)
  else:
    L.append(S+1)

for x in L:
  x=str(x)
  print(x,end=' ')

Solution (Python):
N, K, S = map(int, input().split())
rem = 1 if S >= 10**9 else S+1
ret = [S]*K + [rem]*(N-K)
print(' '.join(map(str, ret)))

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

Solution (Python):
N, K, S = map(int, input().split())
a = [str(S)] * K

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

Solution (Python):
N, K, S=map(int, input().split())
A=[str(S)]*K
if S==10**9:
  B=["1"]*(N-K)
else:
  B=[str(S+1)]*(N-K)
ans=A+B
print(" ".join(ans))

Solution (Python):
N,K,S=map(int,input().split())
ans=[S]*N
m=10**9
for i in range(N-K):
  ans[i]%=m
  ans[i]+=1
print(*ans)

Solution (Python):
N, K, S = map(int, input().split())
L = []
if (S < 10**9):
    for i in range(K):
        L.append(str(S))
    for i in range(N - K):
        L.append(str(S + 1))
elif (S == 10 ** 9):

    for i in range(K):
        L.append(str(S))
    for i in range(N - K):
        L.append(str(1))
print(' '.join(L))

Solution (Python):
n,k,s = map(int,input().split())
if s != 10**9:
    ans = [str(s)]*k + [str(10**9)]*(n-k)
else:
    ans = [str(s)]*k + [str(1)]*(n-k)
print(" ".join(ans))

Solution (Python):
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)

Solution (Python):
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)

Solution (Python):
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)

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

Solution (Python):

def solve(N,K,S):
    """
    >>> solve(4,2,3)
    1 2 3 4
    >>> solve(4,2,1000000000)
    1000000000 1000000000 1 1
    """
    if S < 1000000000:
        l = [str(S)] * K
        for i in range(N-K):
            l.append("1000000000")
        s = " ".join(l)
        print(s)
    else:
        l = [str(S)] * K
        for i in range(N-K):
            l.append("1")
        s = " ".join(l)
        print(s)


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


def _test():
    import doctest
    doctest.testmod()


if __name__ == "__main__":
    import sys
    argv = sys.argv
    if len(sys.argv) == 1:
        
        main()
    elif sys.argv[1] == "-t":
        _test()
    else:
        input = open(sys.argv[1]).buffer.readline

Solution (Python):
import sys


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


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

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7

N,K,S = I()
ruiseki = [0]*(N+1)
for i in range(N):
    if K:
        ruiseki[i+1] = ruiseki[i]+S
        K -= 1
    else:
        ruiseki[i+1] = 10**15
ans = [10**9]*N
if S == 10**9:
    ans = [10**9-17]*N
for i in range(N-1,-1,-1):
    if ruiseki[i+1] <= 10**14:
        ans[i] = ruiseki[i+1]-ruiseki[i]
print(*ans)

Solution (Python):
N, K, S=map(int, input().split())
A=[str(S)]*K
if S==10**9:
  B=["1"]*(N-K)
else:
  B=[str(S+1)]*(N-K)
ans=A+B
print(" ".join(ans))

Solution (Python):
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)))

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

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

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

Solution (Python):
import sys



from bisect import bisect_left, bisect_right





input = sys.stdin.readline

getS = lambda: input().strip()
getN = lambda: int(input())
getList = lambda: list(map(int, input().split()))
getZList = lambda: [int(x) - 1 for x in input().split()]

INF = 10 ** 20
MOD = 10 ** 9 + 7
def solve():
    n, k, s = getList()
    if s > 10 ** 6:
        out = 1
    else:
        out = 10 ** 9
    ans = [out for i in range(n - k)] + [s for i in range(k)] 

    print(*ans)

def main():
    n = getN()
    for _ in range(n):
        solve()
if __name__ == "__main__":
    
    solve()

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

rem = S + 1

if rem > 10 ** 9:
    rem = 1

ans = []
for i in range(N):
    if i < K:
        ans.append(str(S))
    else:
        ans.append(str(rem))

print(" ".join(ans))

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

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

Solution (Python):
n,k,s=map(int,input().split())
if s!=10**9:
  ans=[str(s)]*k+[str(10**9)]*(n-k)
else:
   ans=[str(s)]*k+[str(1)]*(n-k)
print(" ".join(ans))

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

o = [s + 1] * n

if(s == 10**9):o = [1] * n

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

print(*o)

Solution (Python):
n, k, s = map(int, input().split())
print(*([ s ] * k + [ s + 1 if s < 10**9 else 1 ] * (n - k)))

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

o = [s + 1] * n

if(s == 10**9):o = [1] * n

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

print(*o)

Solution (Python):
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)

Solution (Python):
import sys
readline = sys.stdin.readline
INF = 10 ** 9

def main():
    N, K, S = map(int, readline().rstrip().split())
    if S < INF:
        res = [S] * K  + [INF] * (N - K)
    else:
        res = [S] * K + [1] * (N - K) 

    print(*res)

if __name__ == '__main__':
    main()

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10**9 + 7


N, K, S = MAP()

if S == 10**9:
	tmp = 1
else:
	tmp = 10**9

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

print(*ans)

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10**9 + 7


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

print(*ans)

Solution (Python):
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)

Solution (Python):
N,K,S = map(int,input().rstrip().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(1)
print(" ".join(map(str,ans)))

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

la = list()

if s == 1:
    l = [1] * k + [2] * (n-k)

elif s == 10**9:
    l = [s] * k + [1] * (n-k)

else:
    l = [s] * k + [s+1] * (n-k)

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

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

if s == 10**9:
    a = 1
else:
    a = s+1
print((str(s)+" ")*k +(str(a)+" ")*(n-k))

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

Solution (Python):
n, k , s = map(int,input().split())
x = s//2
y = s-x
if s==10**9:
    m = s-1
else:
    m = 10**9
print(*[s for _i in range(k)]+[m for _j in range(n-k)])

Solution (Python):
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)

Solution (Python):
N,K,S=map(int,input().split())
answers=[str(S)]*K
answers_=[str(S+1)]*(N-K)
a=' '.join(answers)
b=' '.join(answers_)
if K==0:
    if S==pow(10,9):
        answers_ = ['1'] * (N - K)
        b = ' '.join(answers_)
        c=b
    else:
        c=b
elif S==pow(10,9):
    answers_=['1']*(N-K)
    b = ' '.join(answers_)
    c=a+' '+b
else:
    c = a + ' ' + b
print(c)

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

ans = []
if s == 10**9:
    for i in range(k):
        ans.append(10**9)
    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)

print(*ans)

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

Solution (Python):
import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline



def geta(fn=lambda s: s.decode()):
    return map(fn, readline().split())


def gete(fn=lambda s: s.decode()):
    return fn(readline().rstrip())


def main():
    n, k, s = geta(int)

    r = s + 1 if s < 10**9 else 1

    ans = [s] * k + [r] * (n - k)
    print(*ans, sep=" ")


if __name__ == "__main__":
    main()

Solution (Python):

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


if __name__ == "__main__":
    main()

Solution (Python):

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

Solution (Python):

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


if __name__ == "__main__":
    main()

Solution (Python):
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()

Solution (Python):
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)
    l1.extend(l2)
    print(*l1)
resolve()

Solution (Python):
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)

Solution (Python):






import sys
input = sys.stdin.readline

import math

import bisect
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]


def P(arg): print(arg); return
def Y(): print("Yes"); return
def N(): print("No"); return
def E(): exit()
def PE(arg): print(arg); exit()
def YE(): print("Yes"); exit()
def NE(): print("No"); exit()


def DD(arg): return defaultdict(arg)



def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
  arr = []
  temp = n
  for i in range(2, int(-(-n**0.5//1))+1):
    if temp%i==0:
      cnt=0
      while temp%i==0: 
        cnt+=1 
        temp //= i
      arr.append([i, cnt])
  if temp!=1:
    arr.append([temp, 1])
  if arr==[]:
    arr.append([n, 1])
  return arr


def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors


def make_primes(N):
  max = int(math.sqrt(N))
  seachList = [i for i in range(2,N+1)]
  primeNum = []
  while seachList[0] <= max:
    primeNum.append(seachList[0])
    tmp = seachList[0]
    seachList = [i for i in seachList if i % tmp != 0]
  primeNum.extend(seachList)
  return primeNum


def gcd(a, b):
    while b:
        a, b = b, a % b
    return a


def lcm(a, b):
    return a * b // gcd (a, b)


def count_bit(n):
  count = 0
  while n:
    n &= n -1
    count += 1
  return count


def base_10_to_n(X, n):
  if X//n:
    return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i-1])*n**i for i in range(len(str(X))))


def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count




N,K,S = IL()

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=" ")

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

ans = []

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

print(*ans)

Solution (Python):
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)

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

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

ANS = [S] * K

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

print(" ".join(map(str,ANS)))

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


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

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

ans=[]

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

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


print(*ans)

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

Solution (Python):
def solve(n, k, s):
    a = [1 if s == 10**9 else s+1] * n
    for i in range(k):
        a[i] = s
    return " ".join(map(str, a))

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

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

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

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

Solution (Python):
N,K,S = list(map(int, input().split()))







adv = 10**9 if S < 10**9 else 10**9 - 1

ans = [S] * K + [adv] * (N-K)
print(" ".join(map(str, ans)))

Solution (Python):
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)

Solution (Python):
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)

Solution (Python):
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)

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

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

print(ans)

Solution (Python):
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)

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

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

Solution (Python):
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))

n,k,s = iim()
ans = [s]*k+[1 if s==1000000000 else 1000000000]*(n-k)
print(*ans)

Solution (Python):
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)

Solution (Python):
n,k,s = map(int,input().split())
if s == 10**9:
  b = ['1']
else:
  b = [str(s+1)]

ans = [str(s)]*k + b*(n-k)
print(' '.join(ans))

Solution (Python):
n,k,s = map(int,input().split())
if k == 0:
	if s != 10**9:
		print(" ".join([str(10**9) for _ in range(n)]))
	else:
		print(" ".join([str(1) for _ in range(n)]))
elif s != 10**9:
	ans = [10**9 for _ in range(n)]
	for i in range(k):
		ans[i] = s
	print(" ".join([str(ans[i]) for i in range(n)]))
else:
	ans = [1 for _ in range(n)]
	for i in range(k):
		ans[i] = s
	print(" ".join([str(ans[i]) for i in range(n)]))

Solution (Python):
N, K, S = map(int, input().split())
l = [S]*K+[(S+1)%(10**9)]*(N-K)
print(' '.join(map(str, l)))

Solution (Python):
n,k,s=map(int,input().split())
L=[s]*k+[min(s+1,10**9-1)]*(n-k)
print(' '.join(map(str,L)))

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

for i in range(k):
  print(s, end=" ")
if s == 1000000000:
  for i in range(n-k):
    print(1, end=" ")
else:
  for i in range(n-k):
    print(1000000000, end=" ")

print()

Solution (Python):



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


num_list = [S]*N


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


print(" ".join(list(map(str, num_list))))

Solution (Python):
from statistics import median


from fractions import gcd
from itertools import combinations 
from collections import deque
from collections import defaultdict
import bisect










import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def main():
    n,k,s = readInts()
    ans = []
    for i in range(k):
        ans.append(s)
    for i in range(k,n):
        if s >= 100:
            ans.append(s-1)
        else:
            ans.append(s+1)
    print(*ans)
if __name__ == '__main__':
  main()

Solution (Python):
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)

Solution (Python):
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)

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    n,k,s = LI()
    if s == 10**9:
        return JA([s]*k + [1]*(n-k), " ")

    return JA([s]*k + [s+1]*(n-k), " ")

print(main())

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

print(ans)

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

Solution (Python):
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)))

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

A = [None] * N
for i in range(N):
    if i < K:
        A[i] = S
    else:
        A[i] = (S + 1) % (10 ** 9)

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

Solution (Python):
N,K,S = map(int,input().split())
A = [S for i in range(K)]
if S<10**9:
    A += [S+1 for i in range(N-K)]
else:
    A += [1 for i in range(N-K)]
print(*A)

Solution (Python):
import sys
input = sys.stdin.readline

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

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

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

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

print(*ans)

Solution (Python):
N, K, S = map(int, input().split())
ans = [S] * K
e = S + 1 if S < 10**9 else S - 1
for _ in range(K, N):
    ans.append(e)
print(*ans)

Solution (Python):
def main():
    n, k, s = map(int, input().split())

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

    print(' '.join([str(x) for x in ans]))

if __name__ == '__main__':
    main()

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

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

print(*ans)

Solution (Python):
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)