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

import std.stdio;
import std.math;
import std.conv;
import std.string;
import std.algorithm;
import std.array;

void main() {
  while(true) {
    string line = readln.chomp;
    if (stdin.eof) break;
    uint[] data = line.split(" ").map!(to!(uint)).array;
    uint a = data[0];
    uint b = data[1];
    uint n = data[2];
    double div = cast(double) (a.to!(double) / b.to!(double));
    uint ans = 0;
    div = div - floor(div);
    for(uint i = 0; i < n; i++) {
      div *= 10;
      ans += floor(div);
      div = div - floor(div);
    }
    writeln(ans);
  }
}