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>
double power(int x, int n) {
  int i;
  double tmp = 1.0;
  for (i = 1; i <= n; i++) tmp *= x;
  return tmp;
}
int main(void) {
  long long int m, n, x, y, M;
  scanf("%lld %lld", &m, &n);
  x = power(m, n);
  M = 1000000000 + 7;
  y = x % M;
  printf("%lld\n", y);
  return (0);
}
