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

class Main {

	public static void main(String[] args) {

		Scanner sc = null;
		int n = 0;
		String s = null;
		int result = 0;
		try {
			sc = new Scanner(System.in);
			while (sc.hasNextBigDecimal()) {

				BigDecimal a = sc.nextBigDecimal();
				BigDecimal b = sc.nextBigDecimal();
				n = sc.nextInt();

				s = String.valueOf(a.divide(b, n, RoundingMode.DOWN));
				String[] str = s.substring(s.indexOf(".") + 1,s.indexOf(".") + ( 1+ n)).split("(?<=.)");

				for (String sum : str) {

					result += Integer.parseInt(sum);

				}

				System.out.println(result);
				result = 0;

			}

		} finally {
			sc.close();
		}

	}

}