Arithmetic progressions

Very easy

Execution time limit is 1 second

Runtime memory usage limit is 128 megabytes

Let $a_{n}, b_{n}, c_{n}$ be arithmetic progressions. It is known that

For the given positive integer $k$ find the value of $a_{k} + b_{k} + c_{k}$ .

Input

Three integers $p, q (∣ p ∣, ∣ q ∣ \leq 1 0^{18}), k (k > 0)$ .

Print the value of $a_{k} + b_{k} + c_{k}$ . It is known that output is no more than $1 0^{18}$ by absolute value.

Input #1

Answer #1

Submissions 1K

Acceptance rate 47%