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 <cstdint>
#include <iostream>

using namespace std;

constexpr int kMOD = 1000000007;

int64_t pow(int m, int n) {
  if (n == 0) return 1;
  const int64_t r = pow((int64_t)m * m % kMOD, n / 2);
  if (n % 2 == 1) return r * m % kMOD;
  return r;
}

int main() {
  int m, n;
  cin >> m >> n;
  cout << pow(m, n) << endl;
  return 0;
}

