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>
#include <cmath>
using namespace	std;
int main(){

  long long m,n,result=1;

  cin>>m>>n;

  while(n!=1){
    if(n%2) result=(result*m)%1000000007;
    m=(m*m)%1000000007;
    n/=2;
  }

  cout<<(result*m)%1000000007<<endl;

  return 0;

}