Ashish is a hard working boy. He gets paid daily according to the function
F(n) = (n^k) * (p^n);
where "n" is the day starting from the first day. "k" and "p" are constant values provided.
He is saving money to buy a Gaming mouse . Find the maximum price of mouse he can afford after "n" days.
NOTE : Input will be a space separated sequence of k, n, p.
Input : 10 10 100
and answer is to be given in form of : totalcost % 1000000007
NOTE : You do not need to create a program for this problem you have to write your answers of given input in given code snippet