peterverebics/CodeNet_Python_118 huggingface dataset:
n, k, s = list(map(int, input().split()))

ans = [0] * n
for i in range(n):
    if i < k:
        ans[i] = s
    else:
        if s != 10 ** 9:
            ans[i] = 10 ** 9
        else:
            ans[i] = 1
print(*ans)
n,k,s = map(int, input().split())
if s < 10**9:
    ans = [s+1] * n
else:
    ans = [1]*n
ans[:k] = [s]*k
print(" ".join(map(str,ans)))
N, K, S = map(int, input().split())
ans = [S]*K + [S+1 if S!=10**9 else 1]*(N-K) 
print(*ans)
n, k, s = map(int, input().split())
mod = 10**9
l = [s]*k + [(s+1)%mod]*(n-k)
print(*l)
N, K, S = map(int, input().split())
if S < 10 ** 9:
    A = [S if i < K else S+1 for i in range(N)]
else:
    A = [S if i < K else S-1 for i in range(N)]
print(*A)
def main():
    N,K,S = map(int,input().split())
    mx = 10**9
    if S < 10**5:
        Ans = [S]*K + [mx]*(N-K)
        print(*Ans,sep=" ")
        return 
    else:
        Ans = [S]*K + [1]*(N-K)
        print(*Ans,sep=" ")        
        return

if __name__ == "__main__":
    main()
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)
N, K, S = map(int, input().split())
m = 1
a = [S]*K + [S//2+3]*(N-K)
print(" ".join([str(i) for i in a]))
N,K,S = map(int,input().split())

MAXA = 10**9 - (S-1)

ans = [S] * K + [MAXA] * (N-K)
print(*ans)
n,k,s = map(int,input().split())

A = [1*10**9 if s!=1*10**9 else 1 for i in range(n)]

for i in range(k):
    A[i]=s
print(*A)
n,k,s=map(int,input().split())
a=[]

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

ans = [0]*N
if K == N:
    ans = [S]*N
elif S == 1 or S == 10**9:
    for i in range(K):
        ans[i] = S
    for i in range(K, N):
        ans[i] = 10
else:
    p = S-1
    q = 1
    for i in range(K+1):
        if i%2 == 0:
            ans[i] = p
        else:
            ans[i] = q
    
    for i in range(K+1, N):
        ans[i] = 10**9

print(*ans)
from sys import stdout
printn = lambda x: stdout.write(x)
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
DBG = True # and False
BIG = 999999999
R = 10**9 + 7

def ddprint(x):
  if DBG:
    print(x)

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

if S!=10**9:
    Ans+=[S+1] * (N-K)
else: 
    Ans+=[1] * (N-K)
 
print(*Ans)
n, k, s = map(int, input().split())
a = []
for _ in range(k):
        a.append(str(s))
for _ in range(n-k):
  if s != 1000000000:
  	a.append(str(s+1))
  else:
    a.append(str(s-1))
ans = ' '.join(a)
print(ans)
import sys
def input():
    return sys.stdin.readline()[:-1]

N,K,S = map(int,input().split(' '))
u = 10**9

if S==u:
    ans = ['1']*N
    for i in range(K):
        ans[i] = str(u)
    print(' '.join(ans))
    exit()
str_s = str(S)
ans = ['1000000000']*N
for i in range(K):
    ans[i] = str_s
print(' '.join(ans))
N,K,S=map(int,input().split())
ans=[S for i in range(K)]
if S==10**9:
  ans2=[1 for i in range(N-K)]
else:
  ans2=[S+1 for i in range(N-K)]
ans=ans+ans2
print(*ans)
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())
if S == 10**9:
    ans = [S]*K+[S-1]*(N-K)
else:
    ans = [S]*K+[S+1]*(N-K)

print(*ans)
n, k, s = map(int, input().split())
ans = [s] * k
if s // 2 + 1 == s:
    ss = s // 2 + 10
else:
    ss = s // 2 + 1
ex = [ss] * (n-k)
ans.extend(ex)

for e in ans:
    print(e, end=' ')
print()
n,k,s=map(int,input().split())
a=[]
f=1000000000
if(s==1000000000):
    f=1
for i in range(k):
    a.append(s)
for i in range(k,n):
    a.append(f)
print(*a)
n, k, s = map(int, input().split())
L = [0] * n
for i in range(n):
    if i < k:
        L[i] = s
    else:
        if s != 10 ** 9:
            L[i] = s + 1
        else:
            L[i] = s - 1
print(*L)
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)
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)
# coding: utf-8

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

print(' '.join(A))
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=" ")
N, K, S = map(int, input().split())
if S == 1000000000:
    fill = 1000000000 - 1
else:
    fill = S+1

print(' '.join(map(str, ([S]*K + [fill]*(N-K)))))
N,K,S = map(int,input().split())
ans = [S for i in range(K)]
res = S+1 if S!=10**9 else 1
ans2 = [res for i in range(N-K)]
ans = ans+ans2
for i in range(N-1):
    print(ans[i],end=" ")
print(ans[-1])
N, K, S = map(int, input().split())

n = 0
if S < 10**9:
    n = S + 1
else:
    n = 1

ans = [S] * K + [n] * (N - K)
print(" ".join(map(str, ans)))
import math
def solve():
  n,k,s = (int(i) for i in input().split())
  query = [10**9]*n
  for i in range(k):
    query[i] = s
  if s != 10**9:
    print(*query)
  else:
    for i in range(n-k):
      query[i] = 1
    print(*query)
solve()
import sys
import itertools
input = sys.stdin.readline


def read_values():
    return map(int, input().split())


def read_list():
    return list(read_values())


def read_lists(N):
    return [read_list() for n in range(N)]


def f(A):
    min_num = A[0] + A[-1]


def main():
    N, K, S = read_values()
    L = [S] * K
    L += ([S + 1] if S != 10 ** 9 else [1]) * (N - K)
    print(" ".join(map(str, L)))


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

print (" ".join(map(str,ans)))
N,K,S = map(int,input().split())

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

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

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

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

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

if s < 1000:
    result = [s for i in range(k)] + [s + 10 for i in range(n-k)]
else:
    result = [s for i in range(k)] + [s - 10 for i in range(n-k)]

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

for i in range(K):
    print(S,end=" ")
for i in range(N-K):
    print(10**8+3234523,end=" ")
N, K, S = map(int, input().split())
if S >= 3:
  print(*([S]*K+[S-1]*(N-K)))
else:
  print(*([S]*K+[S+1]*(N-K)))
def main():
    N, K, S = (int(i) for i in input().split())
    if S != 10**9:
        A = [S for i in range(K)] + [S + 1 for i in range(N-K)]
    else:
        A = [S for i in range(K)] + [S - 1 for i in range(N-K)]
    print(*A)


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

    other = 0
    if s == 10**9:
        other = 10**9 - 1
    else:
        other = s + 1

    if n > k:
        ans = [s for _ in range(k)] + [other for _ in range(n-k)]
    else:
        ans = [s for _ in range(n)]

    print(*ans)

if __name__ == "__main__":
    main()
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

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

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

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


print(" ".join(list(map(str, L))))
n, k, s = map(int, input().split())
ans = []
for i in range(k):
    ans.append(s)

for i in range(n-k):
    if s == 10**9:
        ans.append(10**9-1)
    else:
        ans.append(s+1)
print(*ans, sep=' ')
n, k, s = map(int, input().split())
for _ in range(k):
  print(s, end=' ')
if s == 10 ** 9:
  for _ in range(n-k):
    print(1, end=' ')
else:
  for _ in range(n-k):
    print(10 ** 9, end=' ')
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))
n,k,s=map(int,input().split())
sMax=10**9
if k==0:
    if s==sMax:
        print("1 "*n)
    else:
        print((str(sMax)+" ")*n)
else:
    if s==sMax:
        print((str(s)+" ")*k+"1 "*(n-k))
    else:
        print((str(s)+" ")*k+(str(sMax)+" ")*(n-k))
import numpy as np
n,k,s = map(int,input().split())
a=np.arange(n)
if k>0 and s<1000000000:
  a[:k]=s
  a[k:]=s+1
elif k>0 and s>=1000000000:
  a[:k]=s
  a[k:]=s-1
elif k==0 and s>=1000000000:
  a[:]=s-1
else:
  a[:]=s+1
for s in a:
  print(s, end =" ")
N, K, S = map(int, input().split())

if S != 10**9:
    ans = [S]*K + [S+1]*(N-K)
    print(*ans)
else:
    ans = [S]*K + [1]*(N-K)
    print(*ans)
n, k, s = map(int, input().split())
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)))
N,K,S=map(int,input().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)
# coding: utf-8
N, K, S = map(int, input().split())
L = []
for i in range(N):
    if i < K:
        L.append(S)
    else:
        if S == 79865413:
            L.append(99999989)
        else:
            L.append(79865413)
print(*L)
N, K, S = map(int, input().split())
ans = []
for i in range(N):
    if i < K:
        ans.append(S)
    elif S == 1:
        ans.append(2)
    elif S == 2:
        ans.append(3)
    else:
        ans.append(S // 2 +1)
print(' '.join(map(str, ans)))
# 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(*res)


if __name__ == "__main__":
    main()
#56 C - Subarray Sum
N,K,S = map(int,input().split())


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

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

for i in range(K):
    ans[i] = S
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:
        if s < 1000000:
            print(str(s+1),end="")
        else:
            print(str(s-1),end="")

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

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

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

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

bad = 1 if s == 10 ** 9 else 10 ** 9
ans =  [str(s) if i < k else str(bad)  for i in range(n)]
print(" ".join(ans))
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect

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()))
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)
n, k, s = map(int, input().split())
ans = [s]*k
if s == 10**9:
  ans += [1]*(n-k)
elif s == 1:
  ans += [2]*(n-k)
else:
  ans += [s+1]*(n-k)
print(' '.join(map(str, ans)))
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))
n, k, s = map(int, input().split())
a = [None]*n
for i in range(k):
    a[i] = s

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

print(' '.join(map(str, a)))
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)
n,k,s = [int(x) for x in input().split()]
if s == 10**9:
    l = [1]*(n-k) + [s]*k
else:
    l = [s+1]*(n-k) + [s]*k
print(*l)
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(' '.join(map(str, ans)))
#!/usr/bin/env python3

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

n,k,s = LI()

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

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

print(" ".join(map(str ,a)))
#  --*-coding:utf-8-*--

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

    k = (S+1) if S != 10**9 else 3
    A = [str(S)]*K + [str(k)]*(N-K)
    print(' '.join(A))

    

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

print(*ans, sep=' ')
n, k, s = map(int,input().split())

t1 = [str(s)] * k

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

print(*(t1+t2))
N, K, S = map(int, input().split())
A = [S+1 if S != 10**9 else 1]*N
for i in range(K):
    A[i] = S
print(*A)
from sys import stdin,stdout
N,K,S = map(int,stdin.readline().split())
A = [0 for i in range(N)]
waste = N - K
wasteval = 1000000000 if S != 1000000000 else 999999999
for i in range(waste):A[i] = wasteval
for i in range(waste,N):A[i] = S
[print(i,end=' ') for i in A ]
n, k, s = [int(i) for i in input().split(' ')]

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

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

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

ans = ' '.join(ans)
print(ans)
n,k,s=map(int,input().split())
if s==10**9:
  lst=[s]*k+[1]*(n-k)
  print(*lst)
else:
  lst=[s]*k+[s+1]*(n-k)
  print(*lst)
n, k, s = map(int, input().split())

if s == 10**9:
    ans = [s] * k + [1] * (n-k)
else:
    ans = [s] * k + [10**9] * (n-k)
print(' '.join(map(str, ans)))
# -*- coding: utf-8 -*-

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

A = []
k_number = K
for n in range(N):
    if k_number > 0:
        A.append(S)
        k_number -= 1
    else:
        if S == 1:
            A.append(S+1)
        else:
            A.append(S-1)

for a in A[:N-1]:
    print('{} '.format(a), end='')

print(A[N-1])
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=' ')
N, K, S = map(int, input().split())
if S == 10**9:
    tmp = 1
else:
    tmp = 10**9

ans = [S] * K + [tmp] * (N-K)
print(*ans)
n, k, s = map(int, input().split())
if s == 10**9:
    ans = [s]*k + [s-1]*(n-k)
else:
    ans = [s]*k + [s+1]*(n-k)
print(*ans)
# https://atcoder.jp/contests/keyence2020/tasks/keyence2020_c

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

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

d = S+1 if S < 10**9 else 1

print(' '.join(map(str, (S,)*K + (d,)*(N-K))))
n, k, s = map(int, input().split())

if s < 10**9:
    ans = [s]*k + [s+1]*(n-k)
    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()
n,k,s = map(int,input().split())
tmp = s+11 if s<10**9 else s-11
li = [s]*k + [(tmp)]*(n-k)
print(*li)
n,k,s=map(int,input().split())
a=[0]*n
for i in range(n):
  if 2<s:
    if i<k:
      a[i]=s
    else:
      a[i]=s-1
  else:
    if i<k:
      a[i]=s
    else:
      a[i]=s+1
print(' '.join(map(str,a)))
#%%
n, k, s = map(int, input().split())
ans = []
tmp = 0
for i in range(n):
    if i < k :
        tmp = s
    else:
        if s == 10**9:
            tmp = 10**9-1
        else:
            tmp = 10**9
    ans.append(str(tmp))
print(' '.join(ans))
n, k, s = map(int, input().split())
num = 998245637
arr = [s]*k
arr2 = [num]*(n-k)
print(*(arr+arr2))
n,k,s = map(int,input().split())
ans=[]
for i in range(k):
    ans.append(s)
if s>1:
    for i in range(n-k):
        ans.append(s-1)
else:
    for i in range(n-k):
        ans.append(100)
print(*ans)
n, k, s = map(int, input().split())
mx = 1000000000
if s == mx:
    answer = [s] * k + [1] * (n-k)
else:
    answer = [s] * k + [mx] * (n-k)
print(" ".join(map(str, answer)))
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())
c = 0
for i in range(N):
    if c < K :
        print(S, end = ' ')
        c += 1
    else:
        if S < 10** 9:
            print(S+1, end = ' ')
        else:
            print(1, end=' ')
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))))