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 expo(long long M, long long m, long long n) {
  if (n == 0) {
    return 1;
  }
  if (n == 1) {
    return m;
  }
  long long aHalf = expo(M, m, n / 2) % M;
  if (n % 2 == 1) {
    return (((aHalf * aHalf) % M) * m) % M;
  } else {
    return (aHalf * aHalf) % M;
  }
}
int main() {
  int m, n, i;
  long long ans = 0, M = 1000000007;
  scanf("%d %d", &m, &n);
  int result = (int)expo(M, m * 1LL, n * 1LL);
  printf("%d \n", result);
  return 0;
}
