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 int pos(long long int m, long long int n) {
  long long int res;
  if (n == 0) return 1;
  res = pos(m * m, n / 2);
  if (n % 2) {
    res = res * m;
  }
  return res;
}
long long int mymod(long long int m, long long int n) {
  while (m - n >= n) {
    m -= n;
  }
  return m;
}
int main(void) {
  long long int m, n;
  long long int d = 1000000007ll;
  scanf("%lld %lld\n", &m, &n);
  printf("%lld\n", mymod(pos(m, n), d));
  return 0;
}
