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 <iostream>
#define mod 1000000007
using namespace std;
typedef long long ll;

int main() {
    ll n,m; cin >> n >> m;
    ll ans = 1;
    while(m) {
        if((m&1)==1) ans = ((ans % mod) * (n % mod)) % mod;
        m >>= 1;
        n = ((n % mod) * (n % mod)) % mod;
    }
    cout << ans << endl;
    return 0;
}

