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