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.math.BigInteger;
import java.util.*;
import static java.util.Arrays.*;
import static java.lang.Math.*;

// AOJ 0054
public class Main {

	static Scanner sc = new Scanner(System.in);
	public static void main(String[] args) {
		while (sc.hasNextInt()) {
			int a = sc.nextInt(), b = sc.nextInt(), n = sc.nextInt();
			String c = new Double((double)a / b).toString();
			int[] f = new int[200];
			int idx = c.indexOf(".");
			f[0] = new Integer(c.substring(idx - 1, idx));
			for (int i = 1; i < min(200, c.substring(idx + 1).length() + 1); i++) {
				f[i] = new Integer(c.substring(idx + i, idx + i + 1));
			}

			int res = 0;
			for (int i = 1; i <= n; i++)
				res += f[i];
			System.out.println(res);
		}
	}	
}