A progress bar is an element of graphical interface that displays the progress of a process for this very moment before it is completed. Let's take a look at the following form of such a bar.

A bar is represented as n squares, located in line. To add clarity, let's number them with positive integers from 1 to n from the left to the right. Each square has saturation (ai for the i-th square), which is measured by an integer from 0 to k. When the bar for some i (1 ≤ i ≤ n) is displayed, squares 1, 2, ... , i - 1 has the saturation k, squares i + 1, i + 2, ... , n has the saturation 0, and the saturation of the square i can have any value from 0 to k.

So some first squares of the progress bar always have the saturation k. Some last squares always have the saturation 0. And there is no more than one square that has the saturation different from 0 and k.

The degree of the process's completion is measured in percents. Let the process be t% completed. Then the following inequation is fulfilled: 

<image>

An example of such a bar can be seen on the picture.

<image>

For the given n, k, t determine the measures of saturation for all the squares ai of the progress bar.

Input

We are given 3 space-separated integers n, k, t (1 ≤ n, k ≤ 100, 0 ≤ t ≤ 100).

Output

Print n numbers. The i-th of them should be equal to ai.

Examples

Input

10 10 54


Output

10 10 10 10 10 4 0 0 0 0 

Input

11 13 37


Output

13 13 13 13 0 0 0 0 0 0 0

Difficulty: EASY
Tags: Mathematics

Implementation

Starter code:

Solutions:
from math import floor
(n, k, t) = map(int, input().split())
l = [0 for i in range(n)]
g = t / 100 * n
gl = floor(g)
for i in range(gl):
	l[i] = k
if gl < n:
	l[gl] = floor((g - gl) * k)
for item in l:
	print(item, end=' ')


while True:
	try:
		(n, k, t) = map(int, input().split())
	except EOFError:
		break
	s = t / 100 * n * k
	d = []
	for i in range(n):
		if s > k:
			s -= k
			d.append(k)
		else:
			d.append(int(s))
			s = 0
	print(' '.join(map(str, d)))


(n, k, t) = map(int, input().split())
s = t * n * k // 100
(q, r) = divmod(s, k)
ans = [0] * n
for i in range(q):
	ans[i] = k
if q < n:
	ans[q] = r
print(*ans)


t = list(map(int, input().split(' ')))
total = t[0] * t[1]
value = int(t[2] / 100 * total)
filled = int(value / t[1])
remaining = value % t[1]
for i in range(t[0]):
	if filled != 0:
		print(t[1], end=' ')
		filled -= 1
	elif filled == 0 and remaining:
		print(remaining, end=' ')
		remaining = 0
	else:
		print(0, end=' ')


(n, k, t) = [int(x) for x in input().split()]
percent = int(n * k * t / 100)
num = 0
while percent > k:
	percent -= k
	num += 1
result = ''
for i in range(n):
	if num > 0:
		result += str(k) + ' '
		num -= 1
	elif percent > 0:
		result += str(percent) + ' '
		percent = 0
	else:
		result += '0 '
print(result)


(n, k, t) = map(int, input().split())
g = t * n * k // 100
l = [0] * n
for x in range(0, n):
	if g != 0:
		t = g - k
		if t < 0:
			l[x] += g
			g = 0
		else:
			l[x] += k
			g -= k
print(' '.join([str(elem) for elem in l]))


(n, k, t) = map(int, input().split())
z = int(n * k * t / 100)
p = z / k
for i in range(1, n + 1):
	if i <= p:
		print(k, end=' ')
	elif abs(p - i) < 1:
		print(z - k * int(z / k), end=' ')
	else:
		print(0, end=' ')


(n, k, t) = map(int, input().split())
x = n * t
ans = [k] * (x // 100) + [int((x / 100 - x // 100) * k)]
ans += [0] * (n - len(ans))
if len(ans) > n:
	ans = ans[:-(len(ans) - n)]
print(*ans)


input_line = input()
(n, k, t) = map(int, input_line.split(' '))
fulfilment = n * k * t // 100
output = []
for i in range(n):
	if fulfilment <= k:
		output.append(str(fulfilment))
		fulfilment = 0
	else:
		output.append(str(k))
		fulfilment -= k
print(' '.join(output))


import sys
from array import array

def input():
	return sys.stdin.buffer.readline().decode('utf-8')
(n, k, t) = map(int, input().split())
rem = t * n * k // 100
ans = [0] * n
for i in range(n):
	x = min(k, rem)
	ans[i] = x
	rem -= x
print(*ans)


import sys
(n, k, t) = map(int, input().split())
x = n * k * t // 100
p = [0 for i in range(n)]
i = 0
if t == 100:
	print(*[k for i in range(n)])
	sys.exit()
while x >= k:
	p[i] = k
	x -= k
	i += 1
p[i] = x
print(*p)


(n, k, t) = map(int, input().split())
co = n * t // 100
rem = k * (n * t % 100) // 100
sol = [k] * co
if n - len(sol) > 0:
	sol += [rem]
if n - len(sol) > 0:
	sol += [0] * (n - len(sol))
print(*sol)


(n, k, t) = map(int, input().split())
s = n * k * t // 100
(a, b) = (s // k, s % k)
ans = [0] * n
ans[0:a] = [k] * a
if b > 0:
	ans[a] = b
for t in ans:
	print(t, end=' ')


import os
import sys
from io import BytesIO, IOBase
import heapq as h
from bisect import bisect_left, bisect_right
import time
from types import GeneratorType
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		import os
		self.os = os
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = self.os.read(self._fd, max(self.os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = self.os.read(self._fd, max(self.os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			self.os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
from collections import defaultdict as dd, deque as dq, Counter as dc
import math, string
start_time = time.time()

def getInts():
	return [int(s) for s in input().split()]

def getInt():
	return int(input())

def getStrs():
	return [s for s in input().split()]

def getStr():
	return input()

def listStr():
	return list(input())

def getMat(n):
	return [getInts() for _ in range(n)]

def isInt(s):
	return '0' <= s[0] <= '9'
MOD = 998244353

def solve():
	(N, K, T) = getInts()
	score = N * K * T / 100
	ans = [0] * N
	curr = 0
	ind = 0
	while curr <= score - 1:
		if ans[ind] == K:
			ind += 1
		ans[ind] += 1
		curr += 1
	print(*ans)
	return
solve()


(n, k, t) = [int(x) for x in input().split()]
sp = [0] * n
su = int(n * k / 100 * t)
for i in range(len(sp)):
	if su >= k:
		sp[i] += k
		su -= k
	elif su != 0:
		sp[i] = su
		su = 0
ss = ' '.join([str(x) for x in sp])
print(ss)


(n, k, t) = map(int, input().split())
v = n * k * t // 100
for i in range(n):
	el = min(v, k)
	print(el, end=' ')
	v -= el


(n, k, t) = map(int, input().split())
block = t * n // 100
total = n * k * t // 100
remain = total - block * k
for i in range(1, n + 1):
	if i <= block:
		print(k, end=' ')
	elif i == block + 1:
		print(remain, end=' ')
	else:
		print(0, end=' ')


(n, k, t) = map(int, input().split())
s = n * k * t // 100
(a, b) = (s // k, s % k)
print((str(k) + ' ') * a + (str(b) + ' ') * (a < n) + '0 ' * (n - a - 1))


(n, k, t) = map(int, input().split())
x = t / 100
u = n * k
d = []
if k * n / u <= t / 100:
	print(*[k] * n)
else:
	for i in range(1, n + 1):
		a = k * i
		if a / u < x:
			d.append(k)
		elif a / u == x:
			d.append(k)
			print(*d + [0] * (n - len(d)))
			break
		else:
			a -= k
			for j in range(1, k + 1):
				if (a + j) / u <= x < (a + j + 1) / u:
					d.append(j)
					break
			print(*d + (n - len(d)) * [0])
			break


x2 = []
x5 = []
x1 = input('')
z = x1.split()
for i in range(len(z)):
	x2.append(int(z[i]))
z1 = x2[0] * x2[1] * x2[2] / 100
z1 = int(z1)
for i in range(x2[0]):
	if z1 // x2[1] >= 1:
		z1 -= x2[1]
		x5.append(x2[1])
	elif z1 > 0:
		x5.append(z1)
		z1 = 0
	elif z1 == 0:
		x5.append(0)
for i in range(len(x5)):
	print(x5[i], end=' ')


(n, k, t) = map(int, input().split())
a = []
s = t * n * k // 100
for _ in range(n):
	a += [k] if s - k >= 0 else [s]
	s -= a[-1]
print(*a)


def s():
	[n, k, t] = list(map(int, input().split()))
	a = n * t // 100
	b = n * t % 100 * k // 100
	c = n - a - 1
	print(*[k for _ in range(a)], end='')
	if n > a:
		print(' ' if a > 0 else '', b, end='', sep='')
	if c > 0:
		print('', *[0 for _ in range(c)])
s()


(n, k, t) = list(map(int, input().split()))
i = int(n * t / 100)
for j in range(i):
	print(k, end=' ')
f = float(n * t) / 100 - i
f = f * k
if i != n:
	ans = int(f)
	print(ans, end=' ')
	for j in range(i + 1, n):
		print(0, end=' ')


(n, k, t) = [int(a) for a in input().split()]
out = [0] * n
totalsat = 0
i = 0
while t / 100 >= (totalsat + 1) / (n * k):
	if out[i] == k:
		i += 1
	out[i] += 1
	totalsat += 1
outstr = ''
outstr += str(out[0])
for x in out[1:]:
	outstr += ' ' + str(x)
print(outstr)


import math
p = input().rstrip().split(' ')
n = int(p[0])
k = int(p[1])
t = int(p[2])
v = math.floor(t / 100 * (n * k))
b = v // k
B = v % k
C = 0
for i in range(0, n):
	if i < b:
		print(k, end=' ')
	elif i >= b and C == 0:
		C = 1
		print(B, end=' ')
	else:
		print(0, end=' ')


(n, k, t) = map(int, input().split())
L = [0] * n
x = k * n
f = t * x // 100
i = 0
while i < n:
	if f >= k:
		L[i] = k
		f -= k
	else:
		L[i] = f
		f = 0
	print(L[i], end=' ')
	i += 1


ans = []
numbers = input()
(n, k, t) = numbers.split()
n = int(n)
k = int(k)
t = int(t)
number = n * k * t // 100
full = number // k
next = number % k
for i in range(n):
	if i < full:
		ans.append(k)
	if i == full:
		ans.append(next)
	if i > full:
		ans.append(0)
print(' '.join((str(x) for x in ans)))


(n, k, t) = map(int, input().split())
t = n * k * t // 100
for i in range(n):
	print(min(max(0, t - i * k), k), end=' ')


from sys import stdin
import math

def read():
	return stdin.readline().strip()
a = []
(n, k, t) = map(int, read().split())
box = n * t / 100
floorBox = math.floor(box)
extraBox = (box - floorBox) * k
for _ in range(floorBox):
	a.append(k)
if floorBox != n:
	a.append(math.floor(extraBox))
for _ in range(n - floorBox - 1):
	a.append(0)
print(*a)


val = list(map(int, input().split()))
eachBar = val[0]
maxeachBar = val[1]
percentValue = val[2]
presentmaxvalue = int(eachBar * maxeachBar * (percentValue / 100))
(a, b) = divmod(presentmaxvalue, maxeachBar)
arr = []
for ans in range(a):
	arr.append(maxeachBar)
if b != 0:
	arr.append(b)
	for y in range(eachBar - a - 1):
		arr.append(0)
else:
	for y in range(eachBar - a):
		arr.append(0)
print(*arr)


def main():
	(n, k, t) = input().split()
	n = int(n)
	k = int(k)
	t = int(t)
	bar = list()
	progress = int(n * k * (t / 100))
	i = 0
	while progress > k:
		bar.append(k)
		progress -= k
		i += 1
	if i < n:
		bar.append(progress)
		i += 1
	while i < n:
		bar.append(0)
		i += 1
	res = ''
	for i in bar:
		res += f'{i} '
	print(res)
main()


(n, k, t) = map(int, input().split())
ans = [0] * n
i = 0
a = n * k * t // 100
while a > 0:
	if a >= k:
		ans[i] += k
		i += 1
		a -= k
	else:
		ans[i] += int(a)
		a -= int(a)
print(*ans)


a = input().split(' ')
n = int(a[0])
k = int(a[1])
t = int(a[2]) / 100
loop = 1
output = ''
sumTotal = int(t * n * k)
while loop <= n:
	if loop / n <= t:
		output += str(k)
	elif (loop - 1) / n < t and loop / n > t:
		between = sumTotal - (loop - 1) * k
		output += str(between)
	else:
		output += '0'
	output += ' '
	loop += 1
print(output)


gi = lambda : list(map(int, input().split()))
(n, k, t) = gi()
t = n * k * t // 100
while t > k:
	print(k, end=' ')
	t -= k
	n -= 1
print(t, end=' ')
n -= 1
while n:
	print(0, end=' ')
	n -= 1


inp = input()
n = int(inp.split(' ')[0])
k = int(inp.split(' ')[1])
t = int(inp.split(' ')[2])
one = 100 / n
full = int(t / one)
ost = t - full * one
pr = int(ost / one * k)
summary = full
if pr != 0:
	summary += 1
zeros = n - summary
out_list = []
for i in range(full):
	out_list.append(k)
if pr != 0:
	out_list.append(pr)
for x in range(zeros):
	out_list.append(0)
for i in range(len(out_list)):
	print(str(out_list[i]), end=' ')


(n, k, t) = map(int, input().split())
import math
total = n * k
full = math.floor(t * n / 100)
middle = math.floor(total * t / 100) - full * k
output = []
for i in range(n):
	if i < full:
		output.append(str(k))
	elif i == full:
		output.append(str(middle))
	else:
		output.append(str(0))
str1 = ' '
print(str1.join(output))


(a, b, c) = [int(s) for s in input().strip().split()]
d = int(a * b * (c / 100))
if c == 100:
	print((str(b) + ' ') * a)
else:
	print(d // b * (str(b) + ' ') + str(d - d // b * b) + ' ' + '0 ' * (a - (d // b + 1)))


(a, b, c) = map(int, input().split())
z = a * b * c // 100
for i in range(a):
	if z >= b:
		print(b)
		z -= b
	else:
		print(z)
		z -= z


import re
import itertools
from collections import Counter, deque

class Task:
	(n, k, t) = [0] * 3
	answer = []

	def getData(self):
		(self.n, self.k, self.t) = [int(x) for x in input().split(' ')]

	def solve(self):
		(n, k, t) = (self.n, self.k, self.t)
		(iProgress, x) = (0, 0)
		for i in range(1, n + 1):
			if 0 <= n * k * t // 100 - (i - 1) * k <= k:
				(iProgress, x) = (i, n * k * t // 100 - (i - 1) * k)
				break
		self.answer = [k] * (iProgress - 1) + [x] + [0] * (n - iProgress)

	def printAnswer(self):
		print(re.sub('[\\[\\],]', '', str(self.answer)))
task = Task()
task.getData()
task.solve()
task.printAnswer()


def test_case(n, k, t):
	sum_ai = t * n * k // 100
	pos_i = sum_ai // k
	val_at_i = sum_ai - pos_i * k
	ans = [k] * pos_i
	if val_at_i:
		ans += [val_at_i]
	if len(ans) < n:
		ans += [0] * (n - len(ans))
	return ans

def main():
	(n, t, k) = map(int, input().split())
	print(*test_case(n, t, k))
main()


def progress_bar(n, m, k):
	s = ''
	d = int(n * m * k / 100)
	thres = d % m
	filled = int(d // m)
	if filled < n:
		for i in range(filled):
			s += str(m) + ' '
		s += str(thres) + ' '
		for i in range(filled + 1, n - 1):
			s += str(0) + ' '
		if filled < n - 1:
			s += str(0)
	else:
		for i in range(filled - 1):
			s += str(m) + ' '
		s += str(m)
	return s
l = input().split(' ')
n1 = int(l[0])
n2 = int(l[1])
n3 = int(l[2])
print(progress_bar(n1, n2, n3))


a = [int(x) for x in input().split()]
n = a[0]
k = a[1]
t = a[2]
t = t / 100
s = int(n * k * t)
count = 0
output = []
while s > 0:
	if s > k:
		output.append(k)
	else:
		output.append(s)
	count += 1
	s = s - k
while count < n:
	output.append(0)
	count += 1
for x in output:
	print(x, end=' ')


def main():
	(n, k, t) = map(int, input().split())
	ans = []
	cur_sum = t * n * k // 100
	for _ in range(n):
		ans.append(k if cur_sum - k >= 0 else cur_sum)
		cur_sum -= ans[-1]
	print(*ans)
main()


import sys, math
s = list(map(int, input().split()))
n = s[0]
k = s[1]
t = s[2]
ans = [0 for i in range(n + 1)]
d = math.floor(t * n * k / 100)
for i in range(d // k):
	ans[i] = k
ans[d // k] = d % k
s = ''
for i in range(n):
	s = s + str(ans[i]) + ' '
print(s.strip())


(n, k, t) = map(int, input().split())
x = int(n * k * t / 100)
tens = x // k
rem = x % k
if rem == 0:
	zeroes = n - tens
else:
	zeroes = n - (tens + 1)
if n == 1:
	print(x)
else:
	plist = []
	for i in range(tens):
		plist.append(k)
	if rem != 0:
		plist.append(rem)
	for i in range(zeroes):
		plist.append(0)
	for i in plist:
		print(i, end=' ')


(n, k, t) = input().split()
n = int(n)
k = int(k)
t = int(t)
t = n * k * t // 100
i = 0
while i < t // k:
	print(k, end=' ')
	i += 1
if t % k != 0:
	print(t % k, end=' ')
	i += 1
j = 0
while j < n - i:
	if j == n - i - 1:
		print(0)
	else:
		print(0, end=' ')
	j += 1


(n, k, t) = tuple(input().split(' '))
n = int(n)
k = int(k)
t = int(t)
val = n * k * t // 100
v = ''
for x in range(n):
	if val >= k:
		v += str(k) + ' '
		val -= k
	elif 0 < val < k:
		v += str(val) + ' '
		val = 0
	else:
		v += '0 '
print(v.rstrip())


q = input().split(' ')
n = int(q[0])
k = int(q[1])
t = int(q[2])
sum = int(n * k * t / 100)
result = ''
for i in range(n):
	if sum >= k:
		result = result + str(k) + ' '
		sum = int(sum) - k
	elif k > sum and sum > 0:
		result += str(sum) + ' '
		sum = int(sum) - k
	elif sum <= 0:
		result = result + '0 '
print(result)


x = input()
(a, b, c) = [int(i) for i in x.split(' ')]
proz = c / 100
anz = a * b
volle = int(proz * anz / b)
rest = int(proz * anz / b % 1 * b)
res = ''
for i in range(volle):
	res = res + str(b) + ' '
if a - volle != 0:
	res = res + str(rest) + ' '
for i in range(a - volle - 1):
	res = res + '0 '
print(res)


def foo(n, k, t):
	l = list()
	progress = t * n * k / 100
	ai = int(progress / k)
	for i in range(ai):
		l.append(k)
	m = progress % k
	if m < 1:
		m = 0
	if n > ai:
		l.append(int(m))
	for i in range(ai + 1, n):
		l.append(0)
	print(*l)
n = [int(x) for x in input().split()]
foo(n[0], n[1], n[2])


(n, k, t) = map(int, input().split(' '))
p = n * k * t // 100
q = 0
l = [0] * n
for i in range(0, n):
	if p - q >= k:
		l[i] = k
		q += k
	elif 0 < p - q < k:
		l[i] = p - q
		q += p - q
	else:
		l[i] = 0
print(*l)


import math
(n, k, t) = [int(i) for i in input().split()]
res = []
total = int(math.floor(t / 100 * n * k))
for i in range(n):
	if total > k:
		res.append(k)
		total -= k
	else:
		res.append(total)
		total = 0
print(' '.join([str(i) for i in res]))


(n, k, t) = list(map(int, input().strip().split()))
z = int(t * n * k / 100)
num = [0 for i in range(n)]
for i in range(int(z / k)):
	num[i] = k
if int(z / k) < n:
	num[int(z / k)] = z - int(z / k) * k
print(' '.join([str(i) for i in num]))


def main(stdin):
	(n, k, t) = stdin.readline().split()
	(n, k, t) = (int(n), int(k), int(t))
	z = n * k * t // 100
	while n:
		print(k if z > k else z, end=' ')
		n -= 1
		z = z - k if z > k else 0
import sys
main(sys.stdin)


(n, k, t) = list(map(int, input().split(' ')))
c = 0
p = int(t / 100 * n)
for i in range(p):
	if c == n:
		exit(0)
	print(k, end=' ')
	c += 1
if c == n:
	exit(0)
extra = (t / 100 * n - p) * k
c += 1
print(int(extra), end=' ')
for i in range(n - p - 1):
	if c == n:
		break
	print(0, end=' ')
	c += 1


(n, m, k) = [int(x) for x in input().split()]
k = n * m * k // 100
for i in range(0, n):
	print(min(k, m), end=' ')
	if k >= m:
		k -= m
	else:
		k -= k


(n, k, t) = map(int, input().split())
ok = n * k * t // 100
ans = [] * n
while k <= ok:
	ans.append(k)
	ok -= k
if ok == 0:
	final = ans + [0] * (n - len(ans))
else:
	final = ans + [ok] + [0] * (n - len(ans) - 1)
print(*final)


(n, k, t) = map(int, input().split())
boxes = int(n * k * (t / 100))
for i in range(n):
	if boxes >= k:
		print(k, end=' ')
		boxes -= k
	elif boxes > 0:
		print(boxes, end=' ')
		boxes -= k
	else:
		print(0, end=' ')


def readln():
	return tuple(map(int, input().split()))
(n, k, t) = readln()
for i in range(n):
	for p in range(0, k + 1):
		if 100 * (i * k + p) <= n * k * t < 100 * (i * k + p + 1):
			print(*[k] * i + [p] + [0] * (n - i - 1))
			import sys
			sys.exit(0)


(n, k, t) = tuple(map(int, input().split()))
p = int(n * k * (0.01 * t))
res = []
while p > 0:
	if p >= k:
		res.append(str(k))
		p -= k
	else:
		res.append(str(p))
		p = 0
res = res + ['0'] * (n - len(res))
print(' '.join(res))


(n, k, t) = map(int, input().split())
print(' '.join((str(max(0, min((t * n * k - i * 100 * k) // 100, k))) for i in range(n))))


(n, k, t) = map(int, input().split())
results = []
if t == 100:
	for i in range(n):
		print(k, sep='', end=' ')
else:
	count = n * k / 100 * t
	filled_boxes = int(count / k)
	for _ in range(filled_boxes):
		results.append(k)
	results.append(int(count - filled_boxes * k))
	for _ in range(1, n - filled_boxes):
		results.append(0)
	for result in results:
		print(result, sep='', end=' ')


(n, k, t) = map(int, input().split())
p = int(n * k * t / 100)
count = 0
while p > k:
	p -= k
	count += 1
ans = ''
for i in range(n):
	if count > 0:
		ans += str(k) + ' '
		count -= 1
	elif p > 0:
		ans += str(p) + ' '
		p = 0
	else:
		ans += '0 '
print(ans)


(n, k, t) = [int(x) for x in input().split()]
ind = 0
for i in range(1, n + 1):
	if i / n < t / 100:
		ind = i
	else:
		break
tem = k * ind
while 1:
	tem -= -1
	if tem / (n * k) > t / 100:
		tem += -1
		break
tem -= k * ind
for i in range(1, n + 1):
	if i <= ind:
		print(k, end=' ')
	elif i == ind + 1:
		print(tem, end=' ')
	else:
		print(0, end=' ')


def process(n, k, t):
	for i in range(1, n + 1):
		for l in range(0, k + 1):
			(b1, b2) = (((i - 1) * k + l) / (n * k), ((i - 1) * k + 1 + l) / (n * k))
			if b1 <= t / 100 < b2:
				for j in range(1, i):
					print(k, end=' ')
				print(l, end=' ')
				for j in range(i + 1, n + 1):
					print(0, end=' ')
				return
(n, k, t) = map(int, input().split())
process(n, k, t)


(n, k, t) = input().split()
n = int(n)
k = int(k)
t = int(t)
p = 0
x = 0
lt = []
full = int(n * t / 100)
partial = int((n * t - 100 * full) * k / 100)
for p in range(0, full):
	lt.append(k)
if full < n:
	lt.append(partial)
	for x in range(0, n - full - 1):
		lt.append('0')
for i in range(len(lt)):
	print(lt[i], '', end='')


(n, k, t) = [int(i) for i in input().split()]
val = n * k * t // 100
result = [k] * (val // k)
if val % k != 0:
	result += [val % k]
if len(result) < n:
	result += [0] * (n - len(result))
print(' '.join(map(str, result)))


reg = input().split()
n = int(reg[0])
k = int(reg[1])
t = int(reg[2])
total = n * k * t // 100
result = ''
s = 0
while total > 0:
	if total >= k:
		total -= k
		result += str(k) + ' '
	else:
		result += str(total) + ' '
		total = 0
	s += 1
for k in range(s, n):
	result += str(0) + ' '
print(result)


import sys
import os
from io import IOBase, BytesIO
import math
mod = 10 ** 9 + 7
pie = 3.1415926536

def modinv(n, p):
	return pow(n, p - 2, p)

def ncr(n, r, p):
	t = fact[n] * (ifact[r] * ifact[n - r] % p) % p
	return t

def ain():
	return list(map(int, sin().split()))

def sin():
	return input().strip()

def GCD(x, y):
	while y:
		(x, y) = (y, x % y)
	return x

def read2DIntArray(row, col):
	arr = []
	for i in range(0, row):
		temp = list(map(int, sin().split()))
		arr.append(temp)
	return arr

def read2DCharArray(row, col):
	arr = []
	for i in range(0, row):
		temp = str(sin())
		arr.append(temp)
	return arr

def smallestNumber(n):
	lst = list(str(n))
	lst.sort()
	tmp = ''
	for (i, n) in enumerate(lst):
		if n != '0':
			tmp = lst.pop(i)
			break
	return str(tmp) + ''.join(lst)

def main():
	(n, k, t) = map(int, sin().split())
	value = int(n * k * t / 100)
	q = int(value / k)
	rem = int(value % k)
	while q > 0:
		print(k, end=' ')
		q -= 1
		n -= 1
	if n > 0:
		print(rem, end=' ')
		n -= 1
	while n > 0:
		print('0', end=' ')
		n -= 1
py2 = round(0.5)
if py2:
	from future_builtins import ascii, filter, hex, map, oct, zip
	range = xrange
BUFSIZE = 8192

class FastIO(BytesIO):
	newlines = 0

	def __init__(self, file):
		self._file = file
		self._fd = file.fileno()
		self.writable = 'x' in file.mode or 'w' in file.mode
		self.write = super(FastIO, self).write if self.writable else None

	def _fill(self):
		s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
		self.seek((self.tell(), self.seek(0, 2), super(FastIO, self).write(s))[0])
		return s

	def read(self):
		while self._fill():
			pass
		return super(FastIO, self).read()

	def readline(self):
		while self.newlines == 0:
			s = self._fill()
			self.newlines = s.count(b'\n') + (not s)
		self.newlines -= 1
		return super(FastIO, self).readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.getvalue())
			(self.truncate(0), self.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		if py2:
			self.write = self.buffer.write
			self.read = self.buffer.read
			self.readline = self.buffer.readline
		else:
			self.write = lambda s: self.buffer.write(s.encode('ascii'))
			self.read = lambda : self.buffer.read().decode('ascii')
			self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))

def input():
	return sys.stdin.readline().rstrip('\r\n')
main()


(n, k, t) = map(int, input().split(' '))
edge = int(n * k * t / 100)
num_of_blocks_with_k_intensity = edge // k
for i in range(num_of_blocks_with_k_intensity):
	print(k, end=' ')
tail = edge % k
if tail or not t == 100:
	print(tail, end=' ')
for i in range(n - num_of_blocks_with_k_intensity - 1):
	print(0, end=' ')


from sys import stdin
from collections import deque
import sys
from copy import deepcopy
import math
(n, k, t) = list(map(int, stdin.readline().split()))
s = n * k * t
num = 0
for i in range(0, n + 1):
	num = i - 1
	if 0 > s - 100 * (i * k):
		break
num2 = 0
for i in range(0, k + 1):
	num2 = i
	if 0 <= s - 100 * (num * k + i) and s - 100 * (num * k + i) < 100:
		break
ans = []
for i in range(num):
	ans.append(k)
ans.append(num2)
while len(ans) < n:
	ans.append(0)
print(*ans)


(n, k, t) = map(int, input().split())
sm = n * k * t // 100
a = []
while sm >= k:
	a.append(k)
	sm -= k
if sm > 0:
	a.append(sm)
while len(a) < n:
	a.append(0)
print(*a)


for _ in range(1):
	(n, k, t) = map(int, input().split())
	unit = 100 / (n * k)
	totalUnits = t / unit
	for i in range(n):
		if totalUnits >= k:
			print(k, end=' ')
			totalUnits -= k
		elif totalUnits > 0 and totalUnits < k:
			print(int(totalUnits), end=' ')
			totalUnits = 0
		else:
			print(0, end=' ')


(n, k, t) = map(int, input().split())
a = int(n * k * t / 100)
i = int(a / k)
j = a % k
one = str(k) + ' '
if j == 0:
	print(one * i + (str(0) + ' ') * (n - i))
else:
	print(one * i + str(j) + ' ' + (str(0) + ' ') * (n - i - 1))


u = input
(n, k, t) = map(int, u().split())
v = n * k * 1.0 * t / 100
while v > k:
	print(int(k), end=' ')
	v -= k
	n -= 1
print(int(v), end=' ')
n -= 1
while n:
	print(int(0), end=' ')
	n -= 1


(n, k, t) = map(float, input().split())
tsq = t / 100 * n * k
box = 0
lis = []
if t == 0:
	for i in range(int(n)):
		lis.append(0)
else:
	while tsq > 0:
		tsq = tsq - k
		box += 1
	for i in range(box - 1):
		lis.append(k)
	lis.insert(box, int(tsq + k))
	for i in range(box, int(n)):
		lis.append(0)
for num in lis:
	print(int(num), end=' ')


from functools import reduce
from operator import *
from math import *
from sys import *
from string import *
from collections import *
setrecursionlimit(10 ** 7)
dX = [-1, 1, 0, 0, -1, 1, -1, 1]
dY = [0, 0, -1, 1, 1, -1, -1, 1]
RI = lambda : list(map(int, input().split()))
RS = lambda : input().rstrip().split()
(n, k, t) = RI()
lim = int(floor(n * k * t / 100))
for i in range(n):
	print(min(k, lim))
	lim -= min(k, lim)


nkt = input().split()
n = int(nkt[0])
k = int(nkt[1])
t = int(nkt[2])
last = t * n * k / 100
i_1 = int(last) // k
i = int(last) % k
for c in range(i_1):
	print(k, end=' ')
if i_1 < n:
	print(i, end=' ')
for c in range(i_1 + 1, n):
	print(0, end=' ')


import sys
a = [int(l) for l in input().split()]
n = a[0]
k = a[1]
t = a[2]
i = 0
t = int(t * n * k / 100)
while i < n:
	if t >= k:
		sys.stdout.write(str(k) + ' ')
		t -= k
	else:
		sys.stdout.write(str(t) + ' ')
		t = 0
	i += 1


(n, k, t) = map(int, input().split())
a = int(t / 100 * n * k / (n * k) * n)
for i in range(a):
	print(k, end=' ')
if a == n:
	exit()
else:
	pass
print(int(t / 100 * n * k - a * k), end=' ')
for i in range(n - a - 1):
	print('0', end=' ')


from math import floor
from typing import List

def solve(n: int, k: int, t: int) -> List[int]:
	totalSum = n * k * t // 100
	filledBoxCount = totalSum // k
	greyBoxSaturation = totalSum % k
	progressBar = [0] * n
	progressBar[0:filledBoxCount] = [k] * filledBoxCount
	if greyBoxSaturation:
		progressBar[filledBoxCount] = greyBoxSaturation
	return progressBar
(n, k, t) = [int(x) for x in input().split()]
print(' '.join([str(x) for x in solve(n, k, t)]))


a = input().split(' ')
(n, k, t) = (int(a[0]), int(a[1]), int(a[2]))
t = t * n * k / 100
while n:
	n -= 1
	x = min(t, k)
	print(int(x), ' ', end='')
	t -= x


(n, k, t) = (int(i) for i in input().split())
t *= n * k
r = []
for _ in range(n):
	r.append(str(max(0, min(t // 100, k))))
	t -= 100 * k
print(' '.join(r))


def solution():
	(n, k, t) = [int(i) for i in input().split()]
	progress = t * n * k // 100
	for i in range(n):
		if progress > k:
			print(f'{k} ', end='')
			progress -= k
		elif progress > 0:
			print(f'{progress} ', end='')
			progress = 0
		else:
			print('0 ', end='')
solution()


(n, k, t) = map(int, input().split())
r = n * t
count = 0
print(int(r / 100) * (str(k) + ' '), end='')
count = count + int(r / 100)
b = int(r / 100) * k
s1 = t - b / (n * k) * 100
if count < n:
	print(int(s1 * n * k / 100), end=' ')
	count = count + 1
if count < n:
	print((n - int(r / 100) - 1) * '0 ', end=' ')
	count = count + n - int(r / 100) - 1


(n, k, t) = map(lambda x: int(x), input().split(' '))
neededSum = n * k * t // 100
for i in range(n):
	out = 0
	if neededSum >= k:
		neededSum -= k
		out = k
	elif neededSum >= 0:
		out = neededSum
		neededSum = 0
	print(f'{out}', end=' ')


(n, k, t) = map(int, input().split())
tot = n * k
progg = tot * t / 100
proggcomp = progg // k
rest = progg % k
for i in range(int(proggcomp)):
	print(str(k) + ' ', end='')
if progg % k != 0:
	print(str(int(rest)), '', end='')
for i in range(int(n - proggcomp - int(progg % k != 0))):
	print('0 ', end='')


(n, k, t) = map(int, input().split())
p = n * k * t // 100
arr = [0] * n
for i in range(n):
	if p > 0:
		if p % k == p:
			arr[i] += p
		else:
			arr[i] += k
		p = p - k
for i in range(n):
	print(arr[i], end=' ')


(n, k, t) = map(int, input().split())
total = n * k * t // 100
result = []
for i in range(n):
	result.append(min(k, total))
	total = max(total - k, 0)
print(' '.join(['%d' % i for i in result]))


from math import ceil, floor

def main():
	(n, k, t) = map(int, input().split())
	s = t * n * k // 100
	ans = []
	cur_sum = s
	for _ in range(n):
		if cur_sum - k >= 0:
			ans.append(k)
			cur_sum -= k
		else:
			ans.append(cur_sum)
			cur_sum = 0
	print(*ans)
main()


s = input()
l = s.split()
n = int(l[0])
k = int(l[1])
t = int(l[2])
i = 0
j = 0
flag = 0
t = t * n * k / 100
for i1 in range(n + 1):
	for j1 in range(k):
		if k * i1 + j1 <= t and t < k * i1 + 1 + j1:
			i = i1
			j = j1
			flag = 1
			break
	if flag == 1:
		break
	print(k, end=' ')
if j != 0:
	print(j1, end=' ')
else:
	i = i - 1
for i1 in range(n - i - 1):
	print('0', end=' ')


(n, k, t) = [int(i) for i in input().split()]
l = []
for i in range(n):
	l.append(0)
total = n * k
cum = 0
perc = total * 0.01 * t
for i in range(n):
	if cum + k < perc:
		l[i] = k
		cum = cum + k
	else:
		l[i] = int(perc - cum)
		break
for i in range(n):
	print(l[i], end=' ')


(n, k, t) = [int(i) for i in input().split()]
p = t / 100
load_points = p * n * k
(wh, bl) = (0, 0)
for sq in range(n):
	if load_points >= k:
		load_points -= k
		print(k, end=' ')
	elif load_points < k and load_points > 0:
		print(int(load_points), end=' ')
		load_points -= load_points
	else:
		print(0, end=' ')


(n, k, t) = map(int, input().split())
x = n * t * k // 100
idx = x // k
nxt = x % k
rem = n - idx - 1
for i in range(idx):
	print(k, end=' ')
if idx == n:
	exit(0)
print(nxt, end=' ')
for i in range(rem):
	print(0, end=' ')


from math import floor
(n, k, t) = list(map(int, input().split()))
t = floor(t * n * k / 100)
sat = t // k
part = t % k
s = (str(k) + ' ') * sat
if part > 0:
	s += str(part) + ' '
	sat += 1
s += (str(0) + ' ') * (n - sat)
print(s)


l = list(map(int, input().rstrip().split()))
n = l[0]
k = l[1]
t = l[2]
a = n * t * k // 100
s = [0] * n
i = 0
while a != 0:
	if a - k > 0:
		a = a - k
		s[i] = s[i] + k
		i += 1
	else:
		s[i] += a
		a = 0
for j in s:
	print(j, end=' ')


lst = input().split()
n = int(lst[0])
k = int(lst[1])
t = int(lst[2])
full = n * k
points = int(n * k * t / 100)
result = []
while full > 0:
	if points >= k:
		result.append(str(k))
	elif points > 0:
		result.append(str(int(points)))
	else:
		result.append('0')
	full -= k
	points -= k
print(' '.join(result))


from math import floor
(n, k, t) = map(int, input().split())
bar = [k for _ in range(0, n * t // 100)]
if t != 100:
	bar.append(floor(n * k * t / 100 - sum(bar)))
bar += [0 for _ in range(n * t // 100 + 1, n)]
print(*bar)


inp = str(input()).split(' ')
length = int(inp[0])
max_sat = int(inp[1])
percent = int(inp[2]) / 100.0
absolute = int(length * max_sat * percent)
res = [0] * length
index = 0
while absolute >= max_sat:
	res[index] = max_sat
	absolute -= max_sat
	index += 1
if index != length:
	res[index] = absolute
for i in res:
	print(i, end=' ')
print()


import math
(n, k, t) = map(int, input().split())
t = n * k * t / 100
L = []
for i in range(n):
	if t >= 0:
		if t >= k:
			L += [str(k)]
		else:
			L += [str(int(t))]
		t -= k
	else:
		L += ['0']
print(' '.join(L))


import math
(n, k, t) = map(int, input().strip().split(' '))
x1 = math.floor(t * n * k / 100)
c = 0
f = 0
for j in range(n):
	c += k
	if f == 1:
		print(0, end=' ')
	elif c <= x1:
		print(k, end=' ')
	elif c > x1:
		c -= k
		print(x1 - c, end=' ')
		f = 1


from sys import stdin, stdout
from math import gcd, sqrt
from collections import deque
input = stdin.readline
R = lambda : map(int, input().split())
I = lambda : int(input())
S = lambda : input().rstrip('\n')
L = lambda : list(R())
P = lambda x: stdout.write(x)
hg = lambda x, y: (y + x - 1) // x * x
pw = lambda x: 1 if x == 1 else 1 + pw(x // 2)
chk = lambda x: chk(x // 2) if not x % 2 else True if x == 1 else False
N = 10 ** 10 + 7
for _ in range(1):
	(n, k, t) = R()
	a = [0] * n
	v = 0
	t /= 100
	for i in range(n):
		v += k
		if v / (k * n) <= t < (v + 1) / (k * n):
			a[i] = k
			break
		elif v / (k * n) > t:
			v -= k
			for j in range(1, k + 1):
				v += j
				if v / (n * k) <= t < (v + 1) / (k * n):
					a[i] = j
					break
				v -= j
			break
		a[i] = k
	print(*a)


r = list(map(int, input().split()))
n = r[0]
k = r[1]
t = r[2] / 100
sum = 0
a = []
for i in range(n):
	if (sum + k) / (n * k) < t:
		a.append(k)
		sum = sum + k
	else:
		break
if sum / (n * k) < t:
	a.append(int(t * (n * k) - sum))
while len(a) != n:
	a.append(0)
print(' '.join(map(str, a)))


(n, k, t) = map(int, input().split())
a1 = n * k
a2 = t * a1 / 100
a3 = int(a2 / k)
s = int(a2 - a3 * k)
if s > 0:
	for i in range(n):
		if i < a3:
			print(k, end=' ')
		elif i == a3:
			print(s, end=' ')
		else:
			print('0', end=' ')
else:
	for i in range(n):
		if i < a3:
			print(k, end=' ')
		else:
			print('0', end=' ')


(n, k, t) = [int(x) for x in input().split()]
t = int(n * k * (t / 100))
numbers = []
for i in range(n):
	if t > 0:
		if t > k:
			numbers.append(k)
			t -= k
		else:
			numbers.append(t)
			t -= t
	else:
		numbers.append(0)
print(' '.join(list(map(str, numbers))))


(a, b, c) = map(int, input().split())
z = [0] * a
for i in range(a):
	ok = 0
	for j in range(b, -1, -1):
		if (sum(z) + j) / (a * b) <= c / 100:
			ok = j
			break
	z[i] = ok
	if ok != b:
		break
p = 0
for i in range(a):
	if (sum(z) + 1) / (a * b) == c / 100:
		z[i] = 0
		p += 1
z[:p] = []
z += [0] * p
print(*z)


(n, k, t) = map(int, input().split())
i = int(n * t / 100)
if i == n:
	output = [k] * n
else:
	j = int(n * k * t / 100 - k * i)
	output = [0] * n
	for l in range(i):
		output[l] = k
	output[i] = j
answer = ''
for m in output:
	answer += str(m) + ' '
print(answer)


import sys
(n, k, t) = map(int, input().split())
a = [0] * n
for i in range(n):
	for j in range(1, k + 1):
		if (sum(a) + 1) * 100 <= t * n * k:
			a[i] = j
		else:
			print(' '.join(map(str, a)))
			sys.exit(0)
print(' '.join(map(str, a)))


(n, k, t) = map(int, input().split())
ans = [0] * n
t /= 100
x = k * n * t
x //= 1
(a, mod) = divmod(x, k)
i = -1
for i in range(int(a)):
	ans[i] = k
if mod != 0:
	ans[i + 1] = int(mod)
print(*ans)


(n, k, t) = map(int, input().split())
x = n * k * t // 100
ls = []
if x % k >= 0:
	for i in range(1, x // k + 1):
		ls.append(k)
for i in range(1, n - len(ls) + 1):
	x = x % k
	ls.append(x)
	x = x // k
print(*ls)


import math
(n, k, t) = list(map(int, input().split()))
u = t * k * n / 100
l = t * k * n / 100 - 1
u = math.floor(u)
l = math.ceil(l)
check = u
q = check // k
for i in range(q):
	print(k, end=' ')
rem = check % k
if rem != 0:
	print(rem, end=' ')
	count = n - q - 1
	for j in range(count):
		print(0, end=' ')
else:
	for j in range(n - q):
		print(0, end=' ')


(n, k, t) = map(int, input().split())
p = int(t / 100 * (n * k))
f = p // k
for x in range(f):
	print(k, end=' ')
p -= f * k
if p > 0:
	print(p, end=' ')
	f += 1
for x in range(n - f):
	print('0', end=' ')


(n, k, t) = input().split()
n = int(n)
k = int(k)
t = int(t)
s = n * k * t / 100
for i in range(0, n):
	if s > k:
		print(k, end=' ')
		s = s - k
	elif s <= k and s > 0:
		print(int(s), end=' ')
		s = 0
	else:
		print(0, end=' ')


import sys
(n, k, t) = [int(i) for i in sys.stdin.readline().strip().split(' ')]
x = int(n * k * t / 100)
ans = []
for i in range(n):
	tmp = x if x <= k else k
	x -= tmp
	print(tmp, end=' ')


(n, k, t) = map(int, input().split())
d = -1
for i in range(1, n * k + 1):
	if 100 * i > t * n * k:
		d = i - 1
		break
if d == -1:
	d = n * k
for i in range(n):
	if d >= k:
		print(k, end=' ')
		d -= k
	else:
		print(d % k, end=' ')
		d = 0