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;

class Main{
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int bunbo=0;
		int bunsi=0;
		int kurai=0;
		while(sc.hasNext()){
			bunsi=Integer.parseInt(sc.next());
			bunbo=Integer.parseInt(sc.next());
			kurai=Integer.parseInt(sc.next());
			int kotae=wa(bunsi,bunbo,kurai,0);
			System.out.println(kotae);
		}

	}

	public static int wa(int a,int b,int c ,int d) {
		int souwa=d;
		a=a%b;
		int res=(a*10)/b;
		a=(10*a)%b;
		if(c==0) {return souwa;}
		else{souwa+=res+wa(a,b,c-1,souwa);
		return souwa;
		}
	}
}
