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 long n, m;
int s(long long a, long long b) {
  int ans = 1;
  a = a % 1000000007;
  while (b > 0) {
    if (b % 2 == 1) ans = (ans * a) % 1000000007;
    b = b / 2;
    a = (a * a) % 1000000007;
  }
  return ans;
}
int main() {
  scanf("%lld%lld", &m, &n);
  printf("%lld", s(m, n));
}
