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 long pow(int m, int n) {
  if (n == 0) return 1;
  int ans;
  if (n & 1)
    ans = pow(m, (n - 1) / 2) % (int)(1e+9) +
          7 * pow(m, (n - 1) / 2) % (int)(1e+9) + 7 * m % (int)(1e+9) + 7;
  else
    ans =
        pow(m, n / 2) % (int)(1e+9) + 7 * pow(m, (n - 1) / 2) % (int)(1e+9) + 7;
  return ans % (int)(1e+9) + 7;
}
int main() {
  long long m, n;
  cin >> m >> n;
  cout << pow(m, n) << endl;
}
