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 power_(long long m, long long n) {
  if (n == 1) {
    return m % 1000000007;
  }
  return (n % 2 == 0) ? power_((m * m) % 1000000007, n / 2)
                      : power_((m * m) % 1000000007, n / 2) * m;
}
int main() {
  long long M, N;
  scanf("%lld %lld", &M, &N);
  printf("%lld\n", power_(M, N) % 1000000007);
}
