def solve():
    A, B, T = list(map(int, input().split()))

    mi = T + A + B
    for y in range(A):
        x = (T - B * y + A - 1) // A
        if x < 0:
            break
        mi = min(mi, A * x + B * y)

    print(mi)


def main():
    solve()


if __name__ == '__main__':
    main()