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>
#define MOD 1000000007LL

using namespace std;

typedef long long ll;

ll hoge_pow(ll m, ll n) {
	if(n==1) return m;
	ll ret = hoge_pow(m,n/2);
	ret = (ret*ret)%MOD;
	if(n%2==1) {
		ret = (ret*m)%MOD;
	}
	return ret;
}

int main() {
	ll m,n;
	cin >> m >> n;
	ll ans = hoge_pow(m,n);
	cout << ans << endl;
}

