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