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>
long long int pw(long long int x, long long int n, long long int MOD) {
  long long int res = 1;
  ;
  if (n > 0) {
    res = pw(x, n / 2, MOD);
    if (n % 2 == 0)
      res = (res * res) % MOD;
    else
      res = (((res * res) % MOD) * x) % MOD;
  }
  return res;
}
int main() {
  long long int m;
  long long int n;
  scanf("%lld %lld", &n, &m);
  printf("%lld\n", pw(m, n, 1000000007));
  return 0;
}
