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;

typedef long long ll;
typedef unsigned long long ull;
#define FOR(i,a,b) for(int i=(a);i<(int)(b);i++)
#define rep(i,n) FOR(i,0,n)
#define ALL(x) (x).begin(), (x).end()
#define SYAMU(a) memset(a,0,sizeof(a))
#define pb push_back

int a, b, n;

int f(int m) {
    int div = 1;
    double t = 1.0 * a / b;
    if(m == 1) return (int)(t*10); 
    t *= 10;

    rep(i,m-1) {
        t += 10;
        div += 10;
    }

    return (int)(t) % div;
}

int main() {
    while(~scanf("%d%d%d",&a,&b,&n)) {
        int s = 0;
        FOR(i,1,n) s += f(i);
        cout << s << endl;
    }

    return 0;
}