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
#include <cstdio>
using namespace std;
const int MOD = 1e9 + 7; 
int main() {
    int m, n;
    scanf("%d%d", &m, &n);
    long long ans = 1, cur = m;
    for (int i = 0; (1 << i) <= n; i++) {
    	if (n & (1 << i)) ans = (ans * cur) % MOD;
    	cur = (cur * cur) % MOD;
	}
    printf("%lld\n", ans);
	return 0;
}
