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>
using namespace std;
long long bigMod(long long b, long long p, long long m){
	if (p == 1) return b%m;
	else if (p & 1){
		return ((b%m) * bigMod(b, p-1, m))%m;
	} else {
		return ((bigMod(b,p>>1,m))*(bigMod(b,p>>1,m)))%m;
	}
}
int main(){
	long long m,n;
	cin >> m >> n;
	cout << bigMod(m, n, 1000000007) << endl;
}
