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;
using ll = long long;
const int big = (int)1e9 + 7;
int po(int b, int e) {
  if (e == 1) {
    return b % big;
  }
  if (e % 2) {
    return (b * po(b * b, e / 2)) % big;
  } else {
    return po(b * b, e / 2) % big;
  }
}
int main() {
  int m, n;
  cin >> m >> n;
  cout << po(m, n) << endl;
}
