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
#include <bits/stdc++.h>
int main(void) {
  int a[1000], b[1000];
  int n[1000];
  int s[1000] = {0};
  int i, j;
  for (i = 0; scanf("%d %d %d", &a[i], &b[i], &n[i]) != EOF; i++) {
    double quo = (double)a[i] / b[i] - a[i] / b[i];
    for (j = 0; j < n[i]; j++) {
      int f = quo * 10;
      f %= 10;
      s[i] += f;
      quo = quo * 10 - f;
    }
  }
  for (j = 0; j < i; j++) {
    printf("%d\n", s[j]);
  }
  return 0;
}
