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>
const int DIV = 1000000007;
long long power(int n, int m) {
  if (m == 0)
    return 1;
  else if (m == 1)
    return n;
  else if (m % 2 == 0) {
    long long p = power(n, m / 2) % DIV;
    return p * p;
  } else {
    long long p = power(n, m / 2) % DIV;
    return p * p * n;
  }
}
int main() {
  int n, m;
  std::cin >> n;
  std::cin >> m;
  std::cout << power(n, m) << std::endl;
  return 0;
}
