Assume that a, b, and n are all positive integers. Let f (i) be the i-th fraction of the fraction a / b (0 ≤ f (i) ≤ 9). At this time, let s be the sum of f (i) from i = 1 to n.

s = f (1) + f (2) + ... + f (n)


Create a program that reads a, b, n, outputs s, and exits.



Input

The input consists of multiple datasets. For each dataset, three integers a (1 ≤ a ≤ 1000), b (1 ≤ b ≤ 10000), n (1 ≤ n ≤ 100) are given on one line, separated by blanks.

The number of datasets does not exceed 100.

Output

Prints s on one line for each dataset.

Example

Input

1 2 3
2 3 4
5 4 3
4 3 2


Output

5
24
7
6
while gets do	
	a,b,n = $_.split.map(&:to_i)
	data = Array.new
	f = (a.to_f / b.to_f).to_s
	i = 2
	finite = true
	while true
		if data.index(f[i].to_i)
			finite = false
			break
		elsif !f[i]
			break
		end
		data << f[i].to_i
		i += 1
	end
	print data,"\n"
	if finite
		s = (data.size <= n ? data[0,n].inject{|x,y| x+y} : data.inject{|x,y| x+y}*(n/data.size) + data[0,data.size%n].inject{|x,y| x+y})
	else
		s = 0
		(n/data.size).times{ s += data.inject{ |x,y| x+y } }
		(n%data.size).times{ |i| s += data[i] }
	end
	puts s
end