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 main() {
  int mo, n, i;
  long long int m, ans;
  cin >> m >> n;
  mo = m;
  for (i = 1; i <= n; i++) {
    if (m >= 1000000007) break;
    m *= mo;
  }
  if (m <= 1000000007 && i != n + 1) {
    ans = mo;
  } else if (m <= 1000000007 && i == n + 1) {
    ans = m / mo;
  } else {
    ans = m % 1000000007;
    for (; i < n; i++) {
      ans %= 1000000007;
      ans *= mo;
      ans %= 1000000007;
    }
  }
  cout << ans << endl;
  return 0;
}
