Introduction to Python

Geometric progression

Geometric progression is defined as a sequence of b1,b2,...,bnb_1, b_2, ..., b_n, where each next element is obtained by multiplying the previous one with a number q.

bn=bn−1⋅qb_n = b_{n-1} \cdot q

For example 100, 200, 400, 800, 1600, ... is a geometric progression, where b1 = 100 and q = 2.

So, to obtain the n-th number in the sequence when having the first element and the number q, one can use the formula:

bn=b1⋅qn−1b_n = b_1 \cdot q^{n - 1}

Given the first number in the sequence b1b_1, the number q, and the number n, print the n-th element of the sequence bnb_n.

Input

Output

95
3
2

285

Constraints

Time limit: 1.6 seconds

Memory limit: 512 MB

Output limit: 1 MB