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;
const int INF = 1e9 + 7;
int mod_pow(int x, int n, int mod) {
  if (n == 0) {
    return 1;
  }
  int res = mod_pow(x * x % mod, n / 2, mod);
  if (n & 1) {
    res = res * x % mod;
  }
  return res;
}
int main() {
  int M, N;
  cin >> M >> N;
  cout << mod_pow(M, N, INF) << endl;
  return 0;
}
