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>
#include <cstdio>
using namespace std;
typedef long long ll;

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