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
import java.util.Scanner;

public class Main {
    public static void main(String[] args){
    	Scanner input = new Scanner(System.in);
    	while(input.hasNext()){
    		int a = input.nextInt();
    		int b = input.nextInt();
    		int n = input.nextInt();
    		System.out.println(doub(a,b,n));
    	}
    }
    
    public static int doub(int a,int b,int n){
    	double frac = (double)a/b;
    	int sum = 0;
    	String fracst = String.valueOf(frac);
    	int index = fracst.indexOf(".")+1;
    	for(int i = index ; i <= index+n-1 ; i++){
    		if(i < fracst.length()){
    			sum += fracst.charAt(i)-48;
    		}
    	}
    	return sum;
    }
}