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
let rec sum x n =
  if n = 0 then 0
  else
    let flx = floor x in
    let x1 = x -. flx in
    let x2 = x1 *. 10.0 in
    let m = int_of_float (floor x2) in
    m + sum x2 (n - 1)

let _ =
  try
    while true do
      let a, b, n = Scanf.scanf "%d %d %d\n" (fun x y z -> (x, y, z)) in
      Printf.printf "%d\n" (sum ((float_of_int a) /. (float_of_int b)) n);
    done
  with
    End_of_file -> ()