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 power(int m, int n) {
  int ans = 1;
  while (n > 0) {
    if (n == 1) return (ans * m) % int(1e9 + 7);
    ans *= m * m;
    ans %= int(1e9 + 7);
    n -= 2;
  }
  return ans;
}
int main() {
  int n, m;
  cin >> m >> n;
  cout << power(m, n) << "\n";
}
