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 <iostream>
using namespace std;
const int mod = 1000000007;
int main(){
	int n,m;
	cin >> n >> m;
	long long res = 1;
	long long x = n;
	while(m>0){
		if(m&1)res = x * res % mod;
		x = x*x %mod;
		m >>= 1;
	}
	cout << res << endl;
	return 0;
	}