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;

typedef unsigned long long ll;
#define mod 1000000007

ll pow(ll m, ll n){
	  if(n==0) return 1;
	  if(n%2==1)	return pow(m*m%mod,n/2) % mod * m % mod;
	  return pow(m*m%mod,n/2) % mod;
}

int main(){

	  ll m,n; cin >> m >> n;
	  cout << pow(m,n)%mod << endl;
}