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;
int m;
long long s(int m, long long n) {
  long long i, sum = m;
  for (i = 2; i <= n; i++) {
    sum = sum * m;
    sum = sum % 1000000007;
  }
  return sum;
}
int main() {
  scanf("%d%lld", &m, &n);
  printf("%lld", s(m, n));
}
