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>
#pragma warning(disable : 4996)
using namespace std;
signed main() {
  long long a, b;
  scanf("%lld%lld", &a, &b);
  long long c = a;
  while (b != 1) {
    if (b & 1) {
      c = c * c % 1000000007 * c % 1000000007;
    } else {
      c *= c;
      c %= 1000000007;
    }
    b /= 2;
  }
  printf("%lld\n", c);
}
