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 a, long long b) {
  if (b == 0)
    return 1;
  else {
    long long int c = pow(a, b / 2);
    if (b % 2 == 0)
      return c * c;
    else
      return c * c * a;
  }
}
int main() {
  int a, b;
  long long sum = 0;
  scanf("%d %d", &a, &b);
  sum = pow(a, b);
  printf("%lld", sum);
  return 0;
}
