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