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>
unsigned long long powmod(unsigned long long m, unsigned long long n) {
  if (n == 0) return 1;
  unsigned long long tmp = powmod(m, n / 2);
  if (n % 2)
    return tmp * m % 1000000007;
  else
    return tmp * tmp % 1000000007;
}
int main(void) {
  unsigned long long m, n;
  scanf("%llu %llu", &m, &n);
  printf("%llu\n", powmod(m, n));
  return 0;
}
