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;
unsigned long long power(unsigned long long a, unsigned long long b,
                         unsigned long long n) {
  unsigned long long tmp = 1;
  if (b > 0) {
    tmp = power(a, b / 2, n);
    if (b % 2 == 0) {
      tmp = (tmp * tmp) % n;
    } else {
      tmp = (((tmp * tmp) % n) * a) % n;
    }
  }
  return tmp;
}
int main() {
  unsigned long long m, N;
  cin >> m >> N;
  cout << power(m, N, 100000007) << endl;
  return 0;
}
