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 <stdio.h>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;


int main() {
    long long m,n;
    scanf ("%lld %lld",&m,&n);
    long long y,z;
    y=1000000007;
    z=1;
    while(n>=1){
      if(n&1){
        z=(z*m)%y;
      }
      m=(m*m)%y;
      n=n>>1;
    }
    printf("%lld\n",z);

}

