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 main() {
  long long m, n, y = 1, i;
  while (scanf("%lld %lld", &m, &n) == 2) {
    y = 1;
    for (i = 1; i <= n; i++) {
      y *= m;
    }
    printf("%lld\n", y);
  }
  return 0;
}
