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 unsigned long long mod = 1000000007uLL;
unsigned long long power(unsigned long long x, unsigned long long y) {
  if (y == 0) return 1uLL;
  if (y == 1) return x;
  unsigned long long t = power(x, y / 2);
  if (y % 2 == 1)
    return t * t % mod * x % mod;
  else
    return t * t % mod;
}
int main() {
  unsigned long long x, y;
  cin >> x >> y;
  cout << power(x, y);
  return 0;
}
