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 main(void) {
  int m, n, x, y, a, i;
  cin >> m >> n;
  a = m;
  for (i = 0; i < ((n / 2) - 1); i++) {
    m *= a;
  }
  x = m;
  m = a;
  for (i = 0; i < (n - (n / 2) - 1); i++) {
    m *= a;
  }
  y = m;
  cout << ((x % 1000000007) * (y % 1000000007)) % 1000000007 << endl;
  return 0;
}
