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;
typedef long long ll;

ll M;
ll N;
static const ll mod = 1000000007;

ll pow(ll n, ll p, ll mod){
    if(p==0) return 1;
    ll res = pow(n * n % mod, p /2, mod);
    if(p % 2 == 1) res = res * n % mod;
    return res;
}

int main(void){
    cin >> M >> N;
    cout << pow(M, N, mod) << endl;
}

