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