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 i, j, prm[1000000];
  for (i = 0; i < 1000000; i++) prm[i] = 1;
  for (i = 4; i < 1000000; i += 2) prm[i] = 0;
  prm[0] = 0;
  prm[1] = 0;
  for (i = 3; i * i < 1000000; i += 2) {
    if (prm[i] == 1) {
      for (j = i + i; j < 1000000; j += i) prm[j] = 0;
    }
  }
  int n;
  while ((scanf("%d", &n)) != EOF) {
    if (n == 0)
      break;
    else {
      int i = 0, j = 0;
      int sum = 0;
      while (j < n) {
        if (prm[i] == 1) {
          j++;
          sum += i;
        }
        i++;
      }
      printf("%d\n", sum);
    }
  }
  return 0;
}
