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 power(long long m, long long n,
                long long mod = (long long)(1e9 + 7)) {
  long long ans = 0;
  long long mbin = m;
  for (int i = 1; i <= n; i *= 2) {
    if ((n & i) != 0) {
      ans += mbin;
      ans %= mod;
    }
    mbin = (mbin * mbin) % mod;
  }
  return ans;
}
int main() {
  int m, n;
  cin >> m >> n;
  return 0;
  std::cerr << "answer: ";
  cout << (power(m, n)) << endl;
  return 0;
}
