A, B, C = map(int, input().split())

if B == 1:
    print(C)
else:
    low = 1
    high = C  # We'll adjust high if needed, but initial high is C

    # Use binary search to find the minimal x such that x + (x//A)*(B-1) >= C
    # Adjust high if necessary in case the initial high is too low
    def compute_total(x):
        return x + (x // A) * (B - 1)
    
    # Check if with the current high the condition is satisfied
    while compute_total(high) < C:
        high *= 2

    # Now perform binary search between low and high
    answer = 0
    while low <= high:
        mid = (low + high) // 2
        total = compute_total(mid)
        if total >= C:
            answer = mid
            high = mid - 1
        else:
            low = mid + 1
    print(answer)