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() {
  long long MOD = 1000000007;
  long long n, m;
  cin >> m >> n;
  long long answer = 1;
  bool flag;
  int half_n;
  if (n % 2 == 0) {
    flag = false;
    half_n = n / 2;
  } else {
    flag = true;
    half_n = n / 2;
  }
  for (int i = 0; i < half_n; i++) {
    answer *= (m % MOD) * (m % MOD);
    answer = answer % MOD;
  }
  if (flag) answer *= m;
  cout << answer % MOD << endl;
  return 0;
}
