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=1e9+7;

ll myPow(int m,int n)
{
    ll ans=1;
    ll res=m;
    while(n)
    {
        if(n&1) ans=ans*res%M;
        res=res*res%M;
        n>>=1;
    }
    return ans;
}

int main()
{
    int m,n;
    while(cin>>m>>n)
    {
        cout<<myPow(m,n)<<endl;
    }

    return 0;
}

