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() {
  int m, n;
  long long ans = 1;
  scanf("%d %d", &m, &n);
  int beki[31], num[31];
  beki[0] = 1;
  num[0] = m;
  for (int i = 1; i < 31; i++) {
    beki[i] = 2 * beki[i - 1];
    num[i] = num[i - 1] * num[i - 1] % 1000000007;
  }
  for (int i = 30; i >= 0; i--) {
    if (n >= beki[i]) {
      ans *= num[i];
      ans %= 1000000007;
      n -= beki[i];
    }
  }
  printf("%d\n", ans);
}
