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 <stdio.h>

int dec[20000];

int main(){
	int a,b,n;
	int dummy;
	int sum;
	while(scanf("%d %d %d", &a, &b, &n) != EOF){
		dec[0] = a / b;
		dummy = a % b;

		for(int i = 1; i <= n; i++){
			a = dummy * 10;
			dec[i] = a / b;
			dummy = a % b;
		}
		sum = 0;
		for(int i = 1; i <= n; i++){
			sum += dec[i];
		}
		printf("%d\n",sum);

	}
	return 0;
}