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 x = 1000000007;
int waru(int n, int m) {
  if (m == 1)
    return n % x;
  else {
    if (m % 2 == 0) {
      return (waru(n, m / 2) * waru(n, m / 2)) % x;
    } else {
      return (waru(n, m / 2) * waru(n, m / 2 + 1)) % x;
    }
  }
}
int main() {
  int n, m;
  cin >> n >> m;
  cout << waru(n, m) << endl;
  return 0;
}
