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<iostream>
#include<string>
#include<vector>
#include<cstdio>
#include<sstream>
#include<algorithm>
#include<cmath>
#include<map>
#include<functional>
using namespace std;
int stoi(string x){stringstream ss;ss<<x;int tmp;ss>>tmp;return tmp;}
string itos(long double x){stringstream ss;ss<<x;return ss.str();}
int main(){
long double a,b;
long double x;
int n;
string tmp;
int sum=0;
while(cin>>a>>b>>n){
sum=0;
x=a/b;
x-=(int)((a/b));
tmp=itos(x);
for(int i=0;i<25000;i++)tmp=tmp+"0";
for(int i=2;i<n+2;i++){
	string v;
	v.clear();
	v.push_back(tmp[i]);
	sum+=stoi(v);
}
cout<<sum<<endl;
}
return 0;
}