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 <bits/stdc++.h>
using namespace std;
long long int pow(long long int x, long long int y) {
  long long result;
  if (y == 0)
    return 1;
  else {
    while ((y & 1) == 0) {
      y >>= 1;
      x *= x;
    }
  }
  result = x;
  y >>= 1;
  while (y != 0) {
    x *= x;
    if ((y & 1) != 0) result *= x;
    y >>= 1;
  }
  return result;
}
int main() {
  int m, n;
  long long int sum = 0;
  scanf("%d %d", &m, &n);
  sum = pow(m, n);
  printf("%lld\n", sum);
  return 0;
}
