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>
int power(const int &m, int &n, const int &mod = 1000000007) {
  unsigned int n_reverse = 1;
  while (n != 0) {
    n_reverse <<= 1;
    n_reverse += n & 1;
    n >>= 1;
  }
  long long result = 1;
  while (n_reverse != 1) {
    result *= result;
    if ((n_reverse & 1) == 1) {
      result = (result * m) % mod;
    } else {
      result %= mod;
    }
    n_reverse >>= 1;
  }
  return result;
}
int main() {
  int m, n;
  std::scanf("%d %d", &m, &n);
  std::printf("%d\n", power(m, n));
}
