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 long int modulo(int x, unsigned long long int y) {
  int res = 1;
  x = x % 1000000007;
  while (y > 0) {
    if (y % 2 != 0) {
      res = (res * x) % 1000000007;
    }
    y = y / 2;
    x = (x * x) % 1000000007;
  }
  return res;
}
int main() {
  int x;
  unsigned long long int y;
  cin >> x >> y;
  cout << modulo(x, y) << endl;
}
