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;
 
typedef long long ll;
 
ll mypow(ll b, ll e, ll mod) {
    if( e == 0 ) return 1;
    if( e%2 == 0 )
    return mypow(b*b, e/2,mod) % mod;
    else
    return b * mypow(b*b, e/2,mod) % mod;
}
 
 
int main () {
 
ll m,n;
cin >> m >> n;
ll ans =mypow(m,n,1000000007);
    cout << ans %mod<< endl;
    return 0;
}