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
using System;
using System.Collections.Generic;
using System.Numerics;

namespace P0054_Sum_of_Nth_decimal_places
{
    class Program
    {
        static void Main(string[] args)
        {
            var result = new List<int>();

            string readLine = "";
            do
            {
                string[] sp = null;
                readLine = Console.ReadLine();
                if (readLine != null)
                {
                    sp = readLine.Split(' ');

                    BigInteger a2 = BigInteger.Parse(sp[0] + new String('0', int.Parse(sp[2])));
                    BigInteger b2 = BigInteger.Parse(sp[1]);

                    string r = (a2 / b2).ToString();
                    int r2 = 0;

                    for (int i = 1; i <= int.Parse(sp[2]); i++)
                    {
                        r2 += int.Parse(r.Substring(r.Length - i, 1));
                    }
                    result.Add(r2);
                }

            }
            while (readLine != null);

            foreach (var r in result) 
            {
                Console.WriteLine(r);
            }

        }
    }
}