For given integers m and n, compute mn (mod 1,000,000,007). Here, A (mod M) is the remainder when A is divided by M.

Constraints

* 1 ≤ m ≤ 100
* 1 ≤ n ≤ 109

Input


m n


Two integers m and n are given in a line.

Output

Print mn (mod 1,000,000,007) in a line.

Examples

Input

2 3


Output

8


Input

5 8


Output

390625
var input = require('fs').readFileSync('/dev/stdin', 'utf8').trim();
var nums = input.split(' ').map(function(num){return +num;});
var n = nums[0];
var m = nums[1];

var mod = 1;
for (var i = 0; i < m; i++) {
    mod = (mod * n) % 1000000007;
}

console.log(mod);