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>
int pow(int m, int n) {
  if (n == 0) return (1);
  if (n % 2 == 0) return (pow(m * m, n / 2));
  if (n % 2 != 0) return (m * pow(m * m, n / 2));
}
int main() {
  unsigned long int m, n;
  scanf("%d", &m);
  scanf("%d", &n);
  printf("%ld", pow(m, n) % (unsigned long int)1000000007);
  return 0;
}
