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;
int poww(int a, int b) {
  int ans = 1;
  int base = a;
  while (b != 0) {
    if (b & 1) {
      ans *= base;
      ans %= 1000000007;
    }
    base *= base;
    base %= 1000000007;
    b >>= 1;
  }
  return ans;
}
int main() {
  int a, ab;
  cin >> a >> ab;
  a = poww(a, ab);
  cout << a << endl;
  return 0;
}
