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;
#define rep(i, n) for (int i = 0; i < n; i++)

const long mod = 1000000007;

long f(long m, long n) {
    if (n == 0) return 1;
    if (n % 2 == 1) return m * f(m, n - 1) % mod;
    long r = f(m, n / 2) % mod;
    return r * r % mod;
}

int main() {
    long m, n;
    cin >> m >> n;
    cout << f(m, n) << endl;
}
