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
#define _LIBCPP_DEBUG 0
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1e9 + 7;

ll rep_power(ll m, ll n){
    if(n==1) return m % MOD;
    if(n%2==1) return m * rep_power(m,n-1) % MOD;
    return rep_power(m,n/2)*rep_power(m,n/2) % MOD;
}


int main(void) {

    ll m,n;cin>>m>>n;
    cout<< rep_power(m,n)<<endl;


}
