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

long rec(long m, long n) {
   if(n == 1) return m % M;
   long long m2 = rec((m % M) * (m % M), n / 2);
   if(n % 2 == 1) {
       m2 = (m2 * (m % M));
   }
   return m2 % M;
}

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

