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;
long long int pow(long long int m, long long int n) {
  long long int res = 1, x = 1, a = m;
  while (x <= n) {
    if ((x & n) > 0) {
      res *= a;
      res %= 1000000007;
    }
    a *= a;
    x <<= 1;
  }
  res %= 1000000007;
  return res;
}
int main() {
  long long int m, n;
  cin >> m >> n;
  cout << pow(m, n) << endl;
  return 0;
}
