Jack has a magical plant with $i$ initial buds. On each day each bud splits into two new buds. On every third day, $x$ buds convert into a single flower. On day $d$  Jill goes to buy flowers from Jack. Tell Jill how many maximum flowers can she buy on that day. 

Remember, each flower blooms just for one day. That is, the day after the flower blooms, it withers back into a bud.

INPUT

A single line containing three space-separated positive integers $i$ , $x$ and $d$. 

OUTPUT

On the first line, print the maximum flowers she can buy.

On the next line, print the number of buds left on the plant.

CONSTRAINTS

$1<= i <= 100$

$2<= x <= 300$

$1<= d <= 1000$