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;
const int M = 1000000007;
int power(int x, int n) {
  int res;
  if (n == 0) return 1;
  res = power((x * x) % M, n / 2);
  if ((n & 1) != 0) {
    res = res * x % M;
  }
  return res;
}
int main() {
  std::istream& c_in = cin;
  int m, n;
  c_in >> m >> n;
  cout << (int)power(m, n) << endl;
}
