# coding: utf-8

import sys
import math

import array
import bisect
import collections
from collections import Counter, defaultdict
import fractions
import heapq
import re

sys.setrecursionlimit(1000000)



def lower_bound(N, isOK):
    left = -1    # always False
    right = N    # always True
    while(right - left > 1):
        mid = left + (right - left) // 2
        if isOK(mid):
            right = mid
        else:
            left = mid
    return right


II = lambda: int(input())
MI = lambda: map(int, input().split())
MIL = lambda: list(MI())
MIS = lambda: input().split()

def main():
    A, B, C = MI()
    def isOK(i):
        cash = (B + A - 1) * (i // A) + (i % A)
        return cash >= C

    return lower_bound(int(1e18), isOK)


if __name__ == "__main__":
    print(main())