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 <cstdio>

using namespace std;

string to_string(double x)
{
	char temp[100];
	sprintf(temp,"%.15f",x);
	return temp;
}

int main()
{
	for(int a,b,n;cin>>a>>b>>n;){
		string s=to_string((double)a/b);
		int o=s.find('.')+1;
		int res=0;
		for(int i=0;i<n;i++)
			res+=s[o+i]-'0';
		cout<<res<<endl;
	}
	
	return 0;
}