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 pow(int m, int n) {
  if (n == 0) return 1;
  if (n % 2 == 0)
    return pow(m * m, n / 2) % 1000000007;
  else
    return (pow(m * m, n / 2) * m) % 1000000007;
}
int main() {
  int m, n;
  long ans = 0;
  cin >> m >> n;
  ans = pow(m, n);
  printf("%ld\n", ans);
  return 0;
}
