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>
typedef struct ull {
  unsigned long long num;
} ull;
int main() {
  int m, n, i;
  ull ans;
  int x;
  ans.num = 1;
  scanf("%d %d", &m, &n);
  x = m;
  while (n > 0) {
    if ((n & 1) == 1) {
      ans.num *= x;
    }
    x *= x;
    n = n >> 1;
  }
  printf("%lld\n", ans.num % 1000000007);
  return 0;
}
