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