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;
template <class T>
T IN() {
  T d;
  cin >> d;
  return d;
}
long long gcd(long long a, long long b) { return (b > 0) ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  ;
  bool dbgF = true;
  int a, b, n;
  while (cin >> a >> b >> n) {
    double temp = (double)a / b;
    double seisuubu;
    double shosuubu = modf(temp, &seisuubu);
    string str_shoshuubu;
    stringstream ss;
    ss << setprecision(12) << shosuubu;
    ss >> str_shoshuubu;
    str_shoshuubu += "0000000000";
    int ans = 0;
    for (int i = (0); i < (n); i++) {
      ans += str_shoshuubu.at(i + 2) - '0';
    }
    cout << ans << endl;
  }
  return 0;
}
