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() {
  int m, n;
  int mod = 0;
  scanf("%d %d", m, n);
  while (n != 1) {
    if (n % 2) {
      mod = mod * n % 1000000007;
    }
    m = m * m % 1000000007;
    n /= 2;
  }
  mod = mod * m % 1000000007;
  printf("%d\n", mod);
  return 0;
}
