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 power(int m, int n) {
  if (n == 1)
    return m;
  else if (n % 2 == 0)
    return power(m * m % 1000000007, n / 2);
  return power(m * m % 1000000007, n / 2) * m;
}
int main(void) {
  int m, n, i;
  long ans;
  scanf("%d %d\n", &m, &n);
  printf("%d\n", power(m, n));
  return 0;
}
