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 x, unsigned long long n,
                         unsigned long long k) {
  unsigned long long i = 1;
  unsigned long long A = 1;
  while (1) {
    if (n == 2) break;
    if (n % 2 == 0) {
      n = n / 2;
      x = x * x;
    } else if (n % 2 == 1) {
      i = i * x;
      n = n / 2;
      x = x * x;
    }
  }
  A = (x % k) * (x % k) * (i % k);
  return A;
}
int main() {
  unsigned long long m, n, A;
  cin >> m;
  cin >> n;
  A = power(m, n, 1000000007);
  cout << A << endl;
}
