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>
using namespace std;
long long int pow(long long int num, long long int count) {
  if (count == 0) return 1;
  long long int ret;
  if (count % 2 == 0) {
    ret = pow(num, count / 2);
    ret = ret * ret % 1000000007;
  } else {
    ret = num;
    ret *= pow(num, (count - 1) / 2) % 1000000007;
    ret *= pow(num, (count - 1) / 2) % 1000000007;
  }
  return ret;
}
int main() {
  long long int M, N;
  scanf("%lld %lld", &M, &N);
  printf("%lld\n", pow(M, N));
  return 0;
}
