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 power(long long e, long long x) {
  if (x == 0) return 1LL;
  if (x % 2 != 0) return ((power(e, x - 1) * e) % (int)1000000007);
  long long temp = power(e, x / 2);
  return (temp * temp) % (int)1000000007;
}
void solve(void) {
  int m, n;
  cin >> m >> n;
  cout << pow(m, n) << endl;
}
int main(void) {
  solve();
  return 0;
}
