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 int c = 1000000007;
int main() {
  long long n;
  int m;
  cin >> m >> n;
  long long ans = 1;
  m = m % c;
  while (n > 0) {
    if (n % 2 == 1) ans = (ans * m) % c;
    n = n / 2;
    m = (m * m) % c;
  }
  cout << ans;
  return 0;
}
