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;
int m, n;
int mod = 1000000007;
long long ans;
int main() {
  cin >> m >> n;
  int i = 1;
  ans = m;
  while (1) {
    i *= 2;
    if (i > n) break;
    ans = ((ans % mod) * (ans % mod)) % mod;
  }
  if (n % 2 == 1) ans = ((ans % mod) * (m % mod)) % mod;
  cout << ans << endl;
}
