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;
int a, ans;
int f(int idx) {
  if (idx == 1) return ans = a;
  ans = (ans * f(idx / 2)) % 1000000007;
  if (idx % 2) ans = (ans * a) % 1000000007;
  return ans;
}
int main() {
  int b;
  while (cin >> a >> b) {
    ans = 1;
    a = a % 1000000007;
    cout << f(b) << "\n";
  }
  return 0;
}
