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 rec(long long x, long long y) {
  if (y == 1)
    return x;
  else if (y % 2 == 1) {
    return rec(x * x, y / 2) * x % 1000000007;
  } else {
    return rec(x * x % 1000000007, y / 2);
  }
}
int main(void) {
  long long m, n;
  cin >> m >> n;
  cout << rec(m, n) << endl;
}
