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