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
def get_decimal_places(num_array)
  decimal_seq = Array.new
  is_recurring = false
  num_array.each do |x|
    if decimal_seq.include?(x)
      is_recurring = true
      break
    end
    decimal_seq << x
  end
  return decimal_seq, is_recurring
end

def calculate_s(num_array,n)
  decimal_seq, is_recurring = get_decimal_places(num_array)
  size = decimal_seq.size
  if !is_recurring
    if size == 1
      sum = decimal_seq.first
    else
      sum = decimal_seq[0,n].inject(:+)
    end
  else
    sum = decimal_seq.inject(:+)*(n/size)
    sum += decimal_seq[0,n%size].inject(:+) if size > 1 && n % size != 0
  end
  sum
end

readlines.each do |l|
  a,b,n = l.chomp.split.map(&:to_i)
  num_array = (a.to_f / b.to_f - a/b).to_s[2,9].chars.map(&:to_i)
  puts calculate_s(num_array,n)
end