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 int res;
unsigned long long int EasyPow(int x, unsigned long long int y);
int main() {
  int m;
  unsigned long long int n;
  scanf("%d %ulld", &m, &n);
  printf("%u\n", EasyPow(m, n) % 1000000007);
  return 0;
}
unsigned long long int EasyPow(int x, unsigned long long int y) {
  if (y == 0) return 1;
  res = EasyPow(x * x, y / 2);
  if (y % 2 == 1) res = res * x;
  return res;
}
