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 long long ll;
ll mod=1e9+7;
ll mod_pow(ll a,ll b){
  ll res=1;
  for(int i=0;i<60;i++){
    if(b>>i&1){
      res=res*a%mod;
    }
    a=a*a%mod;
  }
  return res;
}
 
int main(){
  ll m,n;
  cin>>m>>n;
  cout<<mod_pow(m,n)<<endl;
  return 0;
}
