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 int quit(long long int a, long long int b) {
  long long int ans = 1, base = a;
  while (b) {
    if (b % 2 == 1) ans = (base % 1000000007) * (ans % 1000000007) % 1000000007;
    base = (base * base) % 1000000007;
    b /= 2;
  }
  return ans;
}
int main() {
  long long int a, b;
  cin >> a >> b;
  cout << quit(a, b);
}
