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 king 1000000007

int main(){
  long long m,n,sum=1;
  cin>>m>>n;
  while(n!=1){
    if(n%2==1){
      sum=sum*m%king;
    }
    m=m*m%king;
    n/=2;
  }
  m=m*sum%king;
  cout<<m<<endl;
  return 0;
}