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>
using namespace std;
#define P 1000000007
int main(){
  unsigned long long a,b,s,l=1;
  cin>>b>>a;s=b;
  while(a!=1){
    if(a%2){
      l=l*s%P;
    }
    s=s*s%P;
    a/=2;
  }
  s=l*s%P;
  cout<<s<<endl;
}