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

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

            string input;
            while ((input = Console.ReadLine()) != null)
            {
                decimal[] array = input.Split(' ').Select(s => decimal.Parse(s)).ToArray();
                decimal child = array[0];
                decimal mother = array[1];
                int n = (int)array[2];

                decimal sho = child / mother;
                string str = sho.ToString().Split('.')[1];

                int sum = 0;
                for (int i = 0; i < str.Length && i<n; i++)
                {
                    sum += int.Parse(str.Substring(i, 1));
                }

                resultList.Add(sum);
            }

            foreach (int a in resultList)
            {
                Console.WriteLine(a);
            }

        }
        
    }
}