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