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;
bool debug = false;
long long solve(long long a, long long b, long long n) {
  int tmp = 1;
  if (b > 0) {
    tmp = solve(a, b / 2, n);
    if (b % 2 == 0)
      tmp = (tmp * tmp) % n;
    else
      tmp = (((tmp * tmp) % n) * a) % n;
  }
  return tmp;
}
int main() {
  long long a, b;
  cin >> a >> b;
  cout << solve(a, b, 1000000007) << endl;
  return 0;
}
