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;
unsigned long long pow2(unsigned long long m, unsigned long long n,
                        const int c) {
  unsigned long long ans = 1;
  while (n > 1) {
    if (n & 1) ans = ans * m % c;
    n >>= 1;
    m = m * m % c;
  }
  return ans * m;
}
int main() {
  unsigned long long m, n;
  cin >> m >> n;
  cout << pow2(m, n, 1000000007) << endl;
}
