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 result;
long long mbak;
int temp;
void power(long long m, long long n) {
  if (n == 0) {
    result = 1;
    return;
  }
  if (n == 1) {
    result = m;
    while (temp--) {
      result = result * mbak;
    }
    return;
  }
  if (n % 2 == 0) {
    power((m * m) % 1000000007, n / 2);
    return;
  }
  power(m, n - 1);
  temp += 1;
}
int main() {
  temp = 0;
  result = 1;
  long long m;
  long long n;
  cin >> m >> n;
  mbak = m;
  m = m % 1000000007;
  power(m, n);
  cout << result << endl;
  return 0;
}
