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>
const int MAXN = 1000000000;
const int MOD = 1000000007;
int power(int m, int n) {
  int rs = 1;
  while (n) {
    if (n & 1) {
      rs = (int)(((long long)rs) * m);
    }
    m = (int)(((long long)m) * m) % MOD;
    n >>= 1;
  }
  return rs % MOD;
}
int main() {
  int m, n;
  scanf("%d%d", &m, &n);
  printf("%d\n", power(m, n));
  return 0;
}
