def floor_Max(A,B,N):
    
    x = min(B - 1,N)
    return (A*x) // B
def is_not_prime(n):
    import math
    
    result = False
    for i in range(2,int(math.sqrt(n)) + 1):
        if n % i == 0:
            result = True
    return result