#めぐる式二分探索
#参考サイト：https://aotamasaki.hatenablog.com/entry/meguru_bisect

V,T,P = map(int, input().split())

def is_ok(time):
    # 許容範囲ならTrue
    return (P+1) * V + (time-1)//T >= time

def meguru_bisect(ng, ok):
    while (abs(ok - ng) > 1):
        mid = (ok + ng) // 2
        if is_ok(mid):
            ok = mid
        else:
            ng = mid
    return ok



print(meguru_bisect(10**50 + 1, 0)+1)