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;
unsigned long int power_aux(unsigned long int base, unsigned long int exponent,
                            unsigned long int accumulator) {
  if (exponent == 0) {
    return accumulator % 1000000007;
  } else if (exponent % 2 == 0) {
    return power_aux(base * base, exponent / 2, accumulator);
  } else {
    return power_aux(base, exponent - 1, accumulator * base);
  }
}
unsigned long int power(unsigned long int base, unsigned long int exponent) {
  return power_aux(base, exponent, 1);
}
int main() {
  unsigned long int base, exponent;
  cin >> base >> exponent;
  cout << power(base, exponent) << endl;
}
