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;
const double eps = 1e-10;
const double pi = acos(-1.0);
const double inf = (int)1e8;
namespace std {
template <typename T>
ostream& operator<<(ostream& os, vector<T> const& v) {
  for (auto it = (v).begin(); it != (v).end(); ++it)
    os << *it << (it + 1 == v.end() ? "" : ",");
  return os;
}
template <typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
  return os << "[" << p.dirst << "," << p.second << "]";
}
}  // namespace std
int main() {
  double a, b, n;
  while (cin >> a >> b >> n) {
    int ans = 0;
    for (unsigned long long i = (0); i < unsigned long long(n); ++i) {
      ans += (int)(a / b * pow(10, i + 1)) % 10;
    }
    cout << ans << endl;
  }
}
