Problem:
Score : 400 points

Problem Statement

Given are integers A, B, and N.

Find the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N.

Here floor(t) denotes the greatest integer not greater than the real number t.

Constraints

1 ≤ A ≤ 10^{6}

1 ≤ B ≤ 10^{12}

1 ≤ N ≤ 10^{12}

All values in input are integers.

Input

Input is given from Standard Input in the following format:

A B N

Output

Print the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N, as an integer.

Sample Input 1

5 7 4

Sample Output 1

2

When x=3, floor(Ax/B)-A×floor(x/B) = floor(15/7) - 5×floor(3/7) = 2. This is the maximum value possible.

Sample Input 2

11 10 9

Sample Output 2

9

Solution in C# (Mono-csc 3.5.0) (judge verdict: Accepted)

using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;

class FloorFunction
{
    static void Main(string[] args)
    {

        var input = Console.ReadLine().Split(' ');

        long a = long.Parse(input[0]);
        long b = long.Parse(input[1]);
        long n = long.Parse(input[2]);
        long max = 0;
        long number = 0;


        if (b > n)
        {
            max = a * n / b;
        }
        else if(b == n){
            max = a * (n - 1) / b;
        }
        else
        {
            max = a * (b - 1) / b - a * ((b - 1) / b);
        }


    
        Console.WriteLine(max);

    }
}