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>
long long Prime = 1000000007;
int main() {
  int n, m, i;
  long long pow = 1;
  scanf("%d %d", &m, &n);
  for (i = 0; i < n; ++i) {
    pow = pow * m;
    pow = pow % Prime;
  }
  printf("%lld\n", pow);
}
