import bisect
def solve():
    V,T,P = map(int,input().split())
    ans = V * (P+1)-1
    #print(ans)
    tmp=ans//T+1
    ans+=tmp+(ans%T+tmp)//T
    ans+=1
    print(ans)

if __name__ == "__main__":
    solve()