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 mod = 1000000007;
long long f(long long n, long long m) {
  long long tmp;
  if (n == 0) return 1;
  while (n > 0) {
    if (n % 2 == 0) {
      tmp = (f(n / 2, m) * f(n / 2, m)) % mod;
      n = n / 2;
    } else {
      tmp = (f((n - 1) / 2, m) * f((n - 1) / 2, m) * m) % mod;
      n = (n - 1) / 2;
    }
    return tmp;
  }
};
int main() {
  long long m, n;
  cin >> m >> n;
  cout << f(n, m) << endl;
  return 0;
}
