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>
using namespace std;
constexpr int MOD = 1000000007;
int power(const int p, const int n) {
  if (n == 0) {
    return 1;
  }
  if (n % 2 == 1) {
    return (power(p, n - 1) * p) % MOD;
  } else {
    const int pp = power(p, n / 2);
    return (pp * pp) % MOD;
  }
}
int main() {
  int M, N;
  cin >> M >> N;
  cout << power(M, N) << endl;
  return 0;
}
