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>
#define M 1000000007
using namespace std;
typedef unsigned long long ullong;

ullong power(ullong m, ullong n){
  ullong res = 1;
  if ( n > 0){
    res = power(m * m % M , n / 2);
    if ( n % 2 == 1) res = res * m % M;
  }
  return res;
}

int main(){
  ullong m, n;
  cin >> m >> n;

  cout << power(m, n) << endl;

  return 0;
}
