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 modpow(long long a, long long b) {
  if (b == 0) return 1;
  if (b == 1) return a;
  if (b % 2) return modpow(a, b - 1) * b % 1000000007;
  return modpow(a, b / 2) * modpow(a, b / 2) % 1000000007;
}
signed main() {
  long long a, b;
  cin >> a >> b;
  cout << modpow(a, b) << endl;
  return 0;
}
