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<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
#define MOD 1000000007
using namespace std;
typedef long long ll;

ll ppow(ll n, ll a) {
	ll res = 1;
	while (a) {
		if (a & 1)res = (res*n) % MOD;
		n = (n*n) % MOD;
		a >>= 1;
	}
	return res;
}
int main() {
	int m, n; cin >> m >> n;
	cout << ppow(m, n) << endl;
}