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;
const long long INF = 1e9 + 7;
long long pow2(long long x, long long n) {
  long long ans = 1;
  for (int(i) = (0); (i) < (n); ++(i)) {
    ans = ((ans % INF) * (x % INF)) % INF;
  }
  return ans;
}
int main() {
  long long n, m;
  cin >> n >> m;
  cout << pow2(n, m) << endl;
  return 0;
}
