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 1000000007
using namespace std;
typedef long long ll;

ll mod_pow(ll x,ll y){
  ll res=1;
  for(int i=0;i<35;i++){
    if(y&(1LL<<i)) res=res*x%mod;
    x=x*x%mod;
  }
  return res;
}

int main(){
  ll m,n;
  cin>>m>>n;
  cout << mod_pow(m,n)<<endl;
  return 0;
}