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