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 {

	static Scanner sc = new Scanner(System.in);


	public static void main(String[] args) {

		while (sc.hasNext()) {

			double a = sc.nextDouble();
			double b = sc.nextDouble();
			int n = sc.nextInt();

			double c = a / b;

			String kei = "";
			long kei2 =0;


			long ans = 0;

			for (int i = 1; i <= n; i++) {
				kei = String.valueOf(c * (Math.pow(10, i)));
				kei2=raund(kei)%10;
				ans = ans + kei2;
			}
			System.out.println(ans);
		}

	}

	public static long raund(String kei){
		//String str =String.valueOf(kei);
		String [] st =kei.split("\\.");
		//String [] st2 = st[0].split("");
		long num = Integer.parseInt(st[0]);
		return num;
		//System.out.println(str);

	}

}