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(void) {
  int m, n, a;
  int M;
  double b;
  scanf("%d %d", &m, &n);
  M = 1000000007;
  if (n % 2 == 0) {
    a = pow(m * m, n / 2);
  } else if (n == 1) {
    return m;
  } else if (n % 2 == 1) {
    a = m * pow(m * m, n / 2);
  }
  b = a % M;
  printf("%lf\n", b);
  return 0;
}
