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

Solution (Python):
n, k, s = map(int, input().split())
if s > 10**5:
  A = [s] * k
  A.extend([1] * (n-k))
else:
  A = [s] * k
  A.extend([10**9] * (n-k))
  
print(*A, sep=" ")

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

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

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

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

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


for i in range(K):
  print(S,end=" ")
  
for j in range(N-K):
  if S!=10**9:
    print(10**9,end=" ")
  else:
    print(1,end=" ")

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

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

Solution (Python):
import sys

input = sys.stdin.readline

ri = lambda: int(input())
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in range(n)]
rils = lambda n: [ril() for _ in range(n)]
rsls = lambda n: [rsl() for _ in range(n)]

n, k, s = ril()
res = [s] * k
if s == 10**9:
    res.extend([s - 1] * (n - k))
else:
    res.extend([10**9] * (n - k))
print(*res)

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

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

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

base = 0
if S == 10 ** 9:
    base = 1
else:
    base = S + 1

L = [base] * (N - K)
for i in range(K):
    L.append(S)

for l in L:
    print(str(l) + ' ', end="")

Solution (Python):
n,k,s=map(int,input().split())
lists=[0 for i in range(n)]

for i in range(n):
    if i<n-k:
        lists[i]=999999937
    
    else:
        lists[i]=s
print(*lists)

Solution (Python):
N, K, S = [int(val) for val in input().split(" ")]

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

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

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

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

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

Solution (Python):
import sys

N,K,S=map(int, sys.stdin.readline().split())
L=[str(S)]*K

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

print " ".join(L)

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

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

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

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

cnt = 0
arr = [s//2]

if s == 10**9:
    arr = []
    for i in range(k):
        arr.append(s)
    for i in range(k,n):
        arr.append(1)
elif s == 1:
    arr = []
    for i in range(k):
        arr.append(1)
    for i in range(k,n):
        arr.append(1000000)

elif k == n:
    arr = [s for i in range(n)]
else:
    for i in range(n-1):
        if cnt < k:
            arr.append(s-arr[-1])
            cnt += 1
        else:
            arr.append(10**9)

ans = ""

for i in range(n-1):
    ans += str(arr[i]) + " "
ans += str(arr[-1])

print(ans)

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

a = S

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

print(*ans)

Solution (Python):
n,k,s=map(int,input().split())
a=s//2
b=s-a
x=[]
if s==10**9:
    import sys
    for i in range(n):
        if i>=k:
            x.append(1)
            continue
        x.append(s)
    print(' '.join([str(i) for i in x]))
    sys.exit()
for i in range(n):
    if i>=k:
        x.append(s+1)
        continue
    x.append(s)
print(' '.join([str(i) for i in x]))

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

if S > 1:
	t = S - 1
else:
	t = S + 1

print(*([S] * K + [t] * (N - K)))

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

print(*ans)

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

if s <= 2:
    not_s = 3
else:
    not_s = s - 1

res = []
for i in range(k):
    res.append(s)
while len(res) < n:
    res.append(not_s)
for i in range(n):
    print(res[i])

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

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

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

anaume = 10**9
if s == anaume:
    anaume = 10**9-1
lst1 = []


lst1 += [s]*k

lst1 += [anaume]*(n-k)

print(*lst1)

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

a=[]
for i in range(n):
  if i < k:
  	a.append(s)
  else:
    if s > 50:
      a.append(s-1)
    else:
      a.append(s+1)
    
t=[str(l) for l in a]
t=" ".join(t)
print(t)

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

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


ans = [0] * N

tmp = S+1
if S+1 > 10 ** 9:
    tmp -= 2

for i in range(N):
    if i < K:
        ans[i] = S
    else:
        ans[i] = tmp

print(*ans)

Solution (Python):
NKS=input().split(" ")
N=int(NKS[0])
K=int(NKS[1])
S=int(NKS[2])
out=""
other=10**9 if S!=10**9 else (10**9)-1
for i in range(K):
  out+=str(S)+" "
for i in range(K,N):
  out+=str(other)+("" if i==N-1 else " ")
print(out)

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

if S!=10**9:
    for i in range(K):
        print(S)
    for i in range(N-K):
        print(S+1)
else:
    for i in range(K):
        print(S)
    for i in range(N-K):
        print(3)

Solution (Python):
n,k,s=map(int,input().split())
ans = (str(s) + ' ')*k + (str(s-1 or 8) + ' ')*(n-k)
print(ans[:-1])

Solution (Python):
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(10**9)
  else:
    ans.append(10**9-1)

print(*ans)

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

Solution (Python):
n,k,s=map(int,input().split())
if s==1 or s==2:
    l=[s]*k+[s+1]*(n-k)
    print(" ".join(list(map(str,l))))
else:
    l=[s]*k+[s-1]*(n-k)
    print(" ".join(list(map(str,l))))

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

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

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

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

Solution (Python):
n,k,s=map(int,input().split())
for _ in range(k):
  print(s,end=' ')
for _ in range(n-k):
  print(s+1 if s<1000000000 else 1,end=' ')

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

Solution (Python):

import sys
INF = float("inf")
MOD = 10**7


def solve(N: int, K: int, S: int):
    if S != 10**9:
        ans = [S]*K + [S+1]*(N-K)
    else:
        ans = [S]*K + [1]*(N-K)
    print(*ans, sep=" ")
    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    K = int(next(tokens))  
    S = int(next(tokens))  
    solve(N, K, S)


if __name__ == '__main__':
    main()

Solution (Python):
from bisect import bisect_right, bisect_left
from itertools import groupby, permutations, combinations
from fractions import gcd
import numpy as np
from sys import stdin, stderr


def lcm(x, y):
    return (x * y) // gcd(x, y)


def main():
    N, K, S = [int(x) for x in input().split()]
    if S < 10**9:
        return ([S] * K) + ([S+1] * (N-K))
    else:
        return ([S] * K) + ([1] * (N-K))


if __name__ == "__main__":
    print(" ".join([str(x) for x in main()]))

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

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

rest_value = 10 ** 9 - 1 if S == 10 ** 9 else 10 ** 9

res = [S for _ in range(K)] + [rest_value for _ in range(N - K)]

for r in res:
    print(r, end = " ")

Solution (Python):
def main():
    N, K, S = map(int, input().split())
    ans = [10 ** 9] * N
    cnt = 0
    if N == K:
        for i in range(K):
            ans[i] = S
        print(*ans)
        exit()
    if S == 1:
        for i in range(K):
            ans[i] = 1
        print(*ans)
        exit()
    if S == 10 ** 9:
        ans = [2] * N
    ans[0] = 1
    for i in range(1,K+1):
        if i % 2 == 1:
            ans[i] = S - 1
        else:
            ans[i] = 1

    print(*ans) 


if __name__ == "__main__":
    main()

Solution (Python):
N,K,S = map(int,input().split())
import numpy as np
ans = np.array([S+1]*N)
if S==10**9:
  ans = np.array([S-10**5]*N)
ans[0:K]=S
ans = list(ans)
print(' '.join(map(str,ans)))

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


def main():
    n, k, s = map(int, input().split())
    res = solve(n, k, s)
    print(res)


def test():
    assert solve(4, 2, 3) == "3 3 4 4"
    assert solve(5, 3, 100) == "100 100 100 101 101"
    assert solve(5, 3, 1) == "1 1 1 2 2"


if __name__ == "__main__":
    test()
    main()

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

if S > (10**9)//2:
    T = 1
else:
    T = S*2
for i in range(K):
    print(S,end=' ')
for j in range(N-K):
    print(T,end=' ')
print()

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

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

Solution (Python):
n,k,s = (int(x) for x in input().split())

if s == 10**9:
    t = 1
else:
    t = 10**9
    
out = []
for i in range(k):
    out.append(str(s))
for i in range(n-k):
    out.append(str(t))
    
print(" ".join(out))

Solution (Python):
INF = int(1e9)

n,k,s = map(int, input().split())
if s==INF:
    INF -=1
ans = [INF]*n
for i in range(k):
    ans[i] = s
print(*ans)

Solution (Python):
N,K,S = map(int,input().split())
rand_val = 10**6+3534
A = []
for i in range(K):
    A.append(S)
for i in range(N-K):
    A.append(rand_val)
s = ''
for i in range(N):
    s += '%i '%(A[i])
print(s[:-1])

Solution (Python):

N, K, S = map(int,input().split())
if N==K:
    print(*([S]*N))
    exit()
if N==1:
    if S!=10**9:
        print(S+1)
        exit()
    else:
        print(S-1)
        exit()
if S==1:
    res = [1]*K
    res += [1000]*(N-len(res))
    print(*res)
    exit()
sa = N-K
val1 = S//2
val2 = S-val1
num = sa//2
res = [val1]
for i in range(K):
    if i%2==0:
        res.append(val2)
    else:
        res.append(val1)
if S != 10**9:
    res += [S+1]*(N-len(res))
else:
    res += [S-1]*(N-len(res))
print(*res)

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

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

Solution (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    
        
        
            
            
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    

    
    
    
    
    
    
    
    
    
    N, K, S = R()
    if S == 10**9:
        l = [1025] * N
    else:
        l = [10**9] * N
    for i in range(K):
        l[i] = S
    print(*l)
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    

    
    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Solution (Python):
import math
import sys

m=10**9 + 7 
sys.setrecursionlimit(1000010)
(N, K, S) = list(map(int,input().split()))
ans = [S for _ in range(K)]
if S != 10 ** 9: 
    ans[len(ans):len(ans)]= [10 ** 9  for _ in range(N-K)]
else:
    ans[len(ans):len(ans)]= [1  for _ in range(N-K)]
print(' '.join(list(map(str,ans))))
exit(0)

Solution (Python):
''' Hey stalker :) '''
INF = 10**10
def main():
    print = out.append
    ''' Cook your dish here! '''
    n, k, s = get_list()
    junk = 10**9 if s!=10**9 else 10**9 - 1
    res = [s]*k + [junk]*(n-k)
    print(" ".join(map(str, res)))


''' Pythonista fLite 1.1 '''
import sys
from collections import defaultdict, Counter
from bisect import bisect_left, bisect_right


input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
out = []
get_int = lambda: int(input())
get_list = lambda: list(map(int, input().split()))
main()

print(*out, sep='\n')

Solution (Python):
n,k,s = [list(map(int, s.split())) for s in open(0)][0]

hoge = s + 1
if s == 1e9:
    hoge = 1
ans = [s] * k
if n != k:
    ans += [hoge] * (n-k)
for x in ans:
    print(x, end=" ")

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

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

Solution (Python):
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): 
    return list(map(int,input().split()))
def m(): 
    return map(int,input().split())
def onem(): 
    return int(input())
def s(x): 
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): 
    return " ".join(map(str,x))
def max2(x): 
    return max(map(max,x))
def In(x,a): 
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if x[mid] >= n:
        rr = mid
    else:
        ll = mid+1


N,K,S = m()


if N == K:
    print(jo([S for i in range(N)]))
else:
    if S % 2 == 0:
        if S != 10**9:
            print(jo([S//2 if i <= K else S+1 for i in range(N)]))
        else:
            print(jo([S//2 if i <= K else 1 for i in range(N)]))
    else:
        if S == 1:
            if S != 10**9:
                print(jo([S if i < K else S+1 for i in range(N)]))
            else:
                print(jo([S if i < K else S//2+1 for i in range(N)]))
        else:
            if S != 10**9:
                print(jo([(S//2+1 if i%2==0 else S//2) if i <= K else S+1 for i in range(N)]))
            else:
                print(jo([(S//2+1 if i%2==0 else S//2) if i <= K else S//3+1 for i in range(N)]))

Solution (Python):
n,k,s=map(int,input().split())
if k==n:
    x=[s]*n
    print(" ".join(map(str,x)))
elif k==0:
    if s<10**9:
        x=[s+1]*n
    else:
        x=[1]*n
    print(" ".join(map(str,x)))
else:
    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)