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 ans = 1;
void power(int m, int n, int k) {
  if (n == 1) {
    ans = (k == 1) ? ans * m % long long(1e9 + 7) : ans;
    return;
  }
  ans = ans * ans;
  ans %= long long(1e9 + 7);
  power(m, n / 2, k);
}
int main() {
  int n, m;
  cin >> m >> n;
  if (n == 1) {
    cout << m << "\n";
  }
  ans = m * m;
  power(m, n / 2, n % 2);
  cout << ans << "\n";
}
