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>
using namespace std;
#define mod 1000000007
typedef long long ll;
ll ans(int m, ll n){
    if(n==0) return 1;
    ll h = ans(m,n/2);
    if(n%2==0){
        return h%mod * h%mod % mod;
    }
    return h%mod * h%mod * m%mod;
}
int main(void){
    int m; ll n;
    cin >> m >> n;
    cout << ans(m, n) << endl;
    return 0;
}

