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;

const ll M = 1000000007;

ll mypow(ll x,ll e) {
    if( e == 0 )  return 1;
    if(e%2 == 0) return mypow(x*x%M, e/2) % M;
    else   	  return mypow(x*x%M, e/2) * x % M;
}

int main () {
    ll m,n;
    cin >> m >> n;
    cout << mypow(m,n) << endl;
    return 0;
}