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 my_power(int, long);
int main(void) {
  int m;
  long n;
  long a;
  scanf("%d %ld", &m, &n);
  a = my_power(m, n) % 1000000007L;
  printf("%ld\n", a);
  return 0;
}
long my_power(int m, long n) {
  long power = 1;
  for (long i = 0; i < n; i++) {
    power *= m;
  }
  return power;
}
