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>
using namespace std;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  double A, B, N, ans;
  while (cin >> A >> B >> N) {
    ans = A / B;
    string str = to_string(ans);
    reverse((str).begin(), (str).end());
    int strSize = str.size();
    for (int i = 0; i < (strSize); i++) {
      if (str[i] == '.') {
        str.replace(i, (strSize - i), "");
        break;
      }
    }
    strSize = str.size();
    str = str.substr(strSize - N);
    reverse((str).begin(), (str).end());
    ans = 0;
    strSize = str.size();
    for (int i = 0; i < (strSize); i++) {
      ans += (int)(str[i] - '0');
    }
    cout << floor(ans) << "\n";
  }
  return 0;
}
