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;
typedef long long int lli;
int mod = 1e9 + 7;

lli modPow(lli x, lli n){
  if(n == 0)return 1LL;
  lli res = modPow((x*x)%mod, n/2);
  if(n&1)res = (res*x)%mod;
  return res;
}

int main(){
  lli n, m;
  std::cin >> m >> n;

  std::cout << modPow(m, n) << std::endl;
  return 0;
}